ACM Home Page
Please provide us with feedback. Feedback
RankSQL: query algebra and optimization for relational top-k queries
Full text PdfPdf (742 KB)
Source International Conference on Management of Data archive
Proceedings of the 2005 ACM SIGMOD international conference on Management of data table of contents
Baltimore, Maryland
SESSION: Research papers: optimization table of contents
Pages: 131 - 142  
Year of Publication: 2005
ISBN:1-59593-060-4
Authors
Chengkai Li  University of Illinois at Urbana-Champaign
Kevin Chen-Chuan Chang  University of Illinois at Urbana-Champaign
Ihab F. Ilyas  University of Waterloo
Sumin Song  University of Illinois at Urbana-Champaign
Sponsors
ACM: Association for Computing Machinery
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 107,   Citation Count: 34
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1066157.1066173
What is a DOI?

ABSTRACT

This paper introduces RankSQL, a system that provides a systematic and principled framework to support efficient evaluations of ranking (top-k) queries in relational database systems (RDBMS), by extending relational algebra and query optimization. Previously, top-k query processing is studied in the middleware scenario or in RDBMS in a "piecemeal" fashion, i.e., focusing on specific operator or sitting outside the core of query engines. In contrast, we aim to support ranking as a first-class database construct. As a key insight, the new ranking relationship can be viewed as another logical property of data, parallel to the "membership" property of relational data model. While membership is essentially supported in RDBMS, the same support for ranking is clearly lacking. We address the fundamental integration of ranking in RDBMS in a way similar to how membership, i.e., Boolean filtering, is supported. We extend relational algebra by proposing a rank-relational model to capture the ranking property, and introducing new and extended operators to support ranking as a first-class construct. Enabled by the extended algebra, we present a pipelined and incremental execution model of ranking query plans (that cannot be expressed traditionally) based on a fundamental ranking principle. To optimize top-k queries, we propose a dimensional enumeration algorithm to explore the extended plan space by enumerating plans along two dual dimensions: ranking and membership. We also propose a sampling-based method to estimate the cardinality of rank-aware operators, for costing plans. Our experiments show the validity of our framework and the accuracy of the proposed estimation model.


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
 
2
N. Bruno, L. Gravano, and A. Marian. Evaluating top-k queries over web-accessible databases. In ICDE, 2002.
3
4
5
 
6
7
 
8
 
9
10
11
 
12
G. Graefe. The cascades framework for query optimization. IEEE Data Eng. Bull., 18(3): 19--29, 1995.
 
13
 
14
S. Guha, D. Gunopulos, N. Koudas, D. Srivastava, and M. Vlachos. Efficient approximation of optimization queries under parametric aggregation constraints. In VLDB, pages 778--789, 2003.
 
15
S. Guha, N. Koudas, A. Marathe, and D. Srivastava. Merging the results of approximate match operations. In VLDB, pages 636--647, 2004.
 
16
17
18
 
19
20
 
21
I. F. Ilyas, W. G. Aref, and A. K. Elmagarmid. Joining ranked inputs in practice. In VLDB, pages 950--961, 2002.
 
22
I. F. Ilyas, W. G. Aref, and A. K. Elmagarmid. Supporting top-k join queries in relational databases. In VLDB, pages 754--765, 2003.
23
 
24
W. Kießling. Foundations of preferences in database systems. In VLDB, pages 311--322, 2002.
 
25
 
26
 
27
S. Raghavan and H. Garcia-Molina. Complex queries over web repositories. In VLDB, pages 33--44, 2003.
28
 
29
P. Tsaparas, T. Palpanas, Y. Kotidis, N. Koudas, and D. Srivastava. Ranked join indices. In ICDE, 2003.
 
30
 
31
K. Yi, H. Yu, J. Yang, G. Xia, and Y. Chen. Efficient maintenance of materialized top-k views. In ICDE, 2003.

CITED BY  34
Collaborative Colleagues:
Chengkai Li: colleagues
Kevin Chen-Chuan Chang: colleagues
Ihab F. Ilyas: colleagues
Sumin Song: colleagues