| Skip to main content | Skip to navigation |

Register Now!

A Pruning-based Approach for Supporting Top-K Join Queries

  • Jie Liu, Institute of Computing Technology, Chinese Academy of Sciences, China
  • Liang Feng, Institute of Computing Technology, Chinese Academy of Sciences, China
  • Chao He, Institute of Computing Technology, Chinese Academy of Sciences, China
  • Yunpeng Xing, Institute of Computing Technology, Chinese Academy of Sciences, China

Full text:

Track: Posters

An important issue arising from large scale data integration is how to efficiently select the top-K ranking answers from multiple sources while minimizing the transmission cost. This paper resolves this issue by proposing an efficient pruning-based approach to answer top-K join queries. The total amount of transmitted data can be greatly reduced by pruning tuples that can not produce the desired join results with a rank value greater than or equal to the rank value generated so far.

Citation

Liu, J., Feng, L., and Xing, Y. 2006. A pruning-based approach for supporting Top-K join queries. In Proceedings of the 15th International Conference on World Wide Web (Edinburgh, Scotland, May 23 - 26, 2006). WWW '06. ACM Press, New York, NY, 891-892.
DOI= http://doi.acm.org/10.1145/1135777.1135930

Other items being presented by these speakers

Organised by

ECS Logo

in association with

BCS Logo ACM Logo

Platinum Sponsors

Sponsor of The CIO Dinner


Become a sponsor or exhibitor
Valid XHTML 1.0! IFIP logo WWW Conference Committee logo Web Consortium logo Valid CSS!