Bottom-up computation of sparse and Iceberg CUBE
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Optimal aggregation algorithms for middleware
Journal of Computer and System Sciences - Special issu on PODS 2001
DBXplorer: A System for Keyword-Based Search over Relational Databases
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Keyword Searching and Browsing in Databases using BANKS
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Towards keyword-driven analytical processing
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Discover: keyword search in relational databases
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Objectrank: authority-based keyword search in databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Interpreting TF-IDF term weights as making relevance decisions
ACM Transactions on Information Systems (TOIS)
Personalized interactive faceted search
Proceedings of the 17th international conference on World Wide Web
A survey of top-k query processing techniques in relational database systems
ACM Computing Surveys (CSUR)
Answering aggregate keyword queries on relational databases using minimal group-bys
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Aggregate Nearest Keyword Search in Spatial Databases
APWEB '10 Proceedings of the 2010 12th International Asia-Pacific Web Conference
Keyword-based search and exploration on databases
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
TEXplorer: keyword-based object search and exploration in multidimensional text databases
Proceedings of the 20th ACM international conference on Information and knowledge management
Hi-index | 0.00 |
Keyword search on relational databases is useful and popular for many users without technical background. Recently, aggregate keyword search on relational databases was proposed and has attracted interest. However, two important problems still remain. First, aggregate keyword search can be very costly on large relational databases, partly due to the lack of efficient indexes. Second, finding the top-k answers to an aggregate keyword query has not been addressed systematically, including both the ranking model and the efficient evaluation methods. In this paper, the authors tackle these two problems to improve the efficiency and effectiveness of aggregate keyword search on large relational databases. They designed indexes efficient in both size and construction time. The authors propose a general ranking model and an efficient ranking algorithm. They also report a systematic performance evaluation using real data sets.