Abstract
The top-N query problem is to find the N results that satisfy the query condition the best but not necessarily completely. It is gaining importance in relational databases and in e-commerce where services and products are sold on the Internet. This paper addresses three important issues related to the top-N query problem in a relational database context. First, we propose a new query language to facilitate the specification of various top-N queries. This language adds new features to existing languages. Second, we make a case that the sum function is a more appropriate distance function for ranking tuples when attributes involved in a top-N query are incomparable. Third, based on the sum distance function, we discuss how to process top-N queries.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chen, Y.: Raw Sets. The Journal of Fuzzy Mathematics 8(3), 607–617 (2000)
Chen, Y.: Raw Relation Sets, Order Fusion And Top-N Query Problem. Ph.D. Dissertation, Department of Computer Science, Binghamton University (2002)
Chaudhuri, S., Gravano, L.: Evaluating Top-k Selection Queries. In: 25th VLDB Conference, Edinburgh, Scotland, pp. 399–410 (1999)
Carey, M.J., Kossmann, D.: On saying Enough Already! In: SQL. ACM International Conf on Management of Data (SIGMOD 1997), May 1997, pp. 219–230 (1997)
Donjerkovic, D., Ramakrishnan, R.: Probabilistic Optimization of Top N Queries. In: Proc of the 25th VLDB Conf., Edinburgh, Scotland, pp. 411–422 (1999)
Fagin, R.: Combining Fuzzy Information from Multiple Systems. In: PODS 1996, Montreal, Canada, pp. 216–226 (1996)
Yu, C., Sharma, P., Meng, W., Qin, Y.: Database Selection for Processing k Nearest Neighbors Queries in Distributed Environments. In: First ACM/IEEE Joint Conference on Digital Libraries, Roanoke, VA (June 2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, Y., Meng, W. (2003). Top-N Query: Query Language, Distance Function, and Processing Strategies. In: Dong, G., Tang, C., Wang, W. (eds) Advances in Web-Age Information Management. WAIM 2003. Lecture Notes in Computer Science, vol 2762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45160-0_45
Download citation
DOI: https://doi.org/10.1007/978-3-540-45160-0_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40715-7
Online ISBN: 978-3-540-45160-0
eBook Packages: Springer Book Archive