Name
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. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1007/978-3-540-45160-0_45 | ADVANCES IN WEB-AGE INFORMATION MANAGEMENT, PROCEEDINGS |
Keywords | Field | DocType |
top-N query,query language,query processing,distance function | Query optimization,Web search query,Data mining,RDF query language,Query language,Query expansion,Computer science,Sargable,Web query classification,Query by Example,Artificial intelligence,Machine learning | Conference |
Volume | ISSN | Citations |
2762 | 0302-9743 | 5 |
PageRank | References | Authors |
0.42 | 6 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuxi Chen | 1 | 6 | 1.78 |
| Weiyi Meng | 2 | 2722 | 514.77 |