A pruning-based approach for supporting Top-K join queries

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A pruning-based approach for supporting Top-K join queries

Full text

Pdf (328 KB)

Source

International World Wide Web Conference archive
Proceedings of the 15th international conference on World Wide Web table of contents

Edinburgh, Scotland

POSTER SESSION: Browsers and UI, web engineering, hypermedia & multimedia, security, and accessibility table of contents

Pages: 891 - 892

Year of Publication: 2006

ISBN:1-59593-323-9

Authors

Jie Liu	Chinese Academy of Sciences, Beijing, China
Liang Feng	Chinese Academy of Sciences, Beijing, China
Yunpeng Xing	Chinese Academy of Sciences, Beijing, China

Sponsors

SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 8, Downloads (12 Months): 36, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1135777.1135930 What is a DOI?

ABSTRACT

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.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Ronald Fagin, Combining fuzzy information from multiple systems (extended abstract), Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.216-226, June 04-06, 1996, Montreal, Quebec, Canada [doi>10.1145/237661.237715]
	2	Ronald Fagin , Amnon Lotem , Moni Naor, Optimal aggregation algorithms for middleware, Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, p.102-113, May 2001, Santa Barbara, California, United States [doi>10.1145/375551.375567]
	3	Peter J. Haas , Joseph M. Hellerstein, Ripple joins for online aggregation, Proceedings of the 1999 ACM SIGMOD international conference on Management of data, p.287-298, May 31-June 03, 1999, Philadelphia, Pennsylvania, United States
	4	Ilyas, I., Aref, W., and Elmagarmid, A. Supporting Top-K Join Queries in Relational Databases. In Proceedings of VLDB 2003, Berlin, Germany, September 2003.
	5	Amélie Marian , Nicolas Bruno , Luis Gravano, Evaluating top-k queries over web-accessible databases, ACM Transactions on Database Systems (TODS), v.29 n.2, p.319-362, June 2004 [doi>10.1145/1005566.1005569]
	6	Zhuge, H. The Knowledge Grid. World Scientific Publishing Co., Singapore, 2004.
	7	Zhuge, H., Liu, J., Feng, L., Sun, X., and He, C. Query Routing in a Peer-to-Peer Semantic Link Network. Computational Intelligence 21 (2) (2005) 197--216.