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, EDBT'09

Volumn , Issue , 2009, Pages 108-119

  Zhou, Bin ^a   Pei, Jian ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EMPIRICAL EVALUATIONS; EXISTING METHOD; KEYWORD QUERIES; KEYWORD SEARCH; PARTIAL MATCHES; REAL DATA SETS; RELATIONAL DATABASE; SYNTHETIC DATASETS;

ONLINE SEARCHING;

DATABASE SYSTEMS;

EID: 70349108251     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1516360.1516374     Document Type: Conference Paper

References (26)

1. S. Agrawal et al. DBXplorer: A system for keyword-based search over relational databases. In ICDE'02.
2. S. Amer-Yahia et al. Report on the DB/IR panel at sigmod 2005. SIGMOD Record, 34(4):71-74, 2005.
3. K. Beyer and R. Ramakrishnan. Bottom-up computation of sparse and iceberg cubes. In SIGMOD'99.
4. G. Bhalotia et al. Keyword searching and browsing in databases using banks. In ICDE'02.
5. S. Chaudhuri et al. Integrating DB and IR technologies: What is the sound of one hand clapping? In CIDR'05.
6. T. H. Cormen et al. Introduction to Algorithms. McGraw-Hill Higher Education, 2001.
7. B. Ding et al. Finding top-k min-cost connected trees in databases. In IGDE'07.
8. M. Fang et al. Computing iceberg queries efficiently. In VLDB'98.
9. Y. Feng et al. Range Cube: Efficient cube computation by exploiting data correlation. In ICDE'04.
10. M. Garey and D. Johnson. Computers and Intractability: a Guide to The Theory of NP-Completeness. Freeman and Company, New York, 1979.
11. J. Gray et al. Data cube: A relational operator generalizing group-by, cross-tab and sub-totals. In ICDE'96.
12. J. Han et al. Efficient computation of iceberg cubes with complex measures. In SIGMOD'01.
13. D. Harman et al. Inverted files. In Information. retrieval: data structures and algorithms, pages 28-43, Upper Saddle River, NJ, USA, 1992. Prentice-Hall, Inc.
14. H. He et al. BLINKS: ranked keyword searches on graphs. In SIGMOD'07.
15. V. Hristidis et al. Efficient ir-style keyword search over relational databases. In VLDB'03.
16. V. Hristidis and Y. Papakonstantinou. Discover: Keyword search in relational databases. In VLDB'02.
17. V. Kacholia et al. Bidirectional expansion for keyword search on graph databases. In VLDB'0,5.
18. B. Kimelfeld and Y. Sagiv. Finding and approximating top-k answers in keyword proximity search. In PODS'06.
19. F. Liu et al. Effective keyword search in relational databases. In SIGMOD'06.
20. Y. Luo et al. Spark: top-k keyword query in relational databases. In SIGMOD'07.
21. R. T. Ng et al. Iceberg-cube computation with PC clusters. In SIGMOD'01.
22. Q. H. Vu et al. A graph method for keyword-based selection of the top-k databases. In SIGMOD '08.
23. G. Weikum. DB&IR: both sides now. In SIGMOD'07.
24. P. Wu et al. Towards keyword-driven analytical processing. In SIGMOD'07.
25. D. Xin et al. Star-cubing: Computing iceberg cubes by top-down and bottom-up integration. In VLDB'02.
26. B. Yu et al. Effective keyword-based selection of relational databases. In SIGMOD'07.