NDLI: Supporting top-k join queries in relational databases

Please wait, while we are loading the content...

Supporting top-k join queries in relational databases

Content Provider	Springer Nature Link
Author	Ilyas, Ihab F. Aref, Walid G. Elmagarmid, Ahmed K.
Copyright Year	2004
Abstract	Ranking queries, also known as top-k queries, produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results. Top-k queries are dominant in many emerging applications, e.g., multimedia retrieval by content, Web databases, data mining, middlewares, and most information retrieval applications. Current relational query processors do not handle ranking queries efficiently, especially when joins are involved. In this paper, we address supporting top-k join queries in relational query processors. We introduce a new rank-join algorithm that makes use of the individual orders of its inputs to produce join results ordered on a user-specified scoring function. The idea is to rank the join results progressively during the join operation. We introduce two physical query operators based on variants of ripple join that implement the rank-join algorithm. The operators are nonblocking and can be integrated into pipelined execution plans. We also propose an efficient heuristic designed to optimize a top-k join query by choosing the best join order. We address several practical issues and optimization heuristics to integrate the new join operators in practical query processors. We implement the new operators inside a prototype database engine based on PREDATOR. The experimental evaluation of our approach compares recent algorithms for joining ranked inputs and shows superior performance.
Starting Page	207
Ending Page	221
Page Count	15
File Format	PDF
ISSN	10668888
Journal	The VLDB Journal
Volume Number	13
Issue Number	3
e-ISSN	0949877X
Language	English
Publisher	Springer-Verlag
Publisher Date	2004-01-01
Publisher Place	Berlin, Heidelberg
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Ranking Top-k queries Rank aggregarion Query operators
Content Type	Text
Resource Type	Article
Subject	Information Systems Hardware and Architecture

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Semantics and evaluation of top-k queries in probabilistic databases

Supporting ranking queries on uncertain and incomplete data

Depth estimation for ranking query optimization

Top-k typicality queries and efficient query answering methods on large databases

Keyword search in relational databases

Adaptive query relaxation and top-k result ranking over autonomous web databases

Shooting top-k stars in uncertain databases

Subscription-based data aggregation techniques for top-k monitoring queries

Scalable and efficient processing of top-k multiple-type integrated queries

Supporting top-k join queries in relational databases

Similar Documents

Semantics and evaluation of top-k queries in probabilistic databases

Supporting ranking queries on uncertain and incomplete data

Depth estimation for ranking query optimization

Top-k typicality queries and efficient query answering methods on large databases

Keyword search in relational databases

Adaptive query relaxation and top-k result ranking over autonomous web databases

Shooting top-k stars in uncertain databases

Subscription-based data aggregation techniques for top-k monitoring queries

Scalable and efficient processing of top-k multiple-type integrated queries

Supporting top-k join queries in relational databases