Supporting top-K keyword search in XML databases

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2010, Pages 689-700

  Chen, Liang Jeff ^a   Papakonstantinou, Yannis ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EXPERIMENTAL EVALUATION; EXPONENTIAL COMPUTATION; INFORMATION DISCOVERY; KEYWORD QUERIES; KEYWORD SEARCH; LOWEST COMMON ANCESTORS; QUERY SEMANTICS; RELATIONAL DATABASE; SEMI STRUCTURED DATA; WORK FOCUS; XML DATABASE;

ALGORITHMS; DATABASE SYSTEMS; LIFE CYCLE; MARKUP LANGUAGES; SEMANTICS;

XML;

EID: 77952750773     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2010.5447818     Document Type: Conference Paper

References (32)

1. S. Agrawal, S. Chaudhuri, and G. Das, "Dbxplorer: A system for keyword-based search over relational databases," in ICDE, 2002, pp. 5-16.
2. G. Bhalotia, A. Hulgeri, C. Nakhe, S. Chakrabarti, and S. Sudarshan, "Keyword searching and browsing in databases using banks," in ICDE, 2002, pp. 431-440.
3. V. Hristidis and Y. Papakonstantinou, "Discover: Keyword search in relational databases," in VLDB, 2002, pp. 670-681.
4. F. Liu, C. T. Yu, W. Meng, and A. Chowdhury, "Effective keyword search in relational databases," in SIGMOD Conference, 2006, pp. 563-574.
5. L. Guo, F. Shao, C. Botev, and J. Shanmugasundaram, "Xrank: Ranked keyword search over xml documents," in SIGMOD Conference, 2003, pp. 16-27.
6. Y. Xu and Y. Papakonstantinou, "Efficient keyword search for smallest lcas in xml databases," in SIGMOD Conference, 2005, pp. 537-538.
7. V. Hristidis, N. Koudas, Y. Papakonstantinou, and D. Srivastava, "Keyword proximity search in xml trees," IEEE Trans. Knowl. Data Eng., vol. 18, no. 4, pp. 525-539, 2006.
8. Y. Xu and Y. Papakonstantinou, "Efficient lca based keyword search in xml data," in EDBT, 2008, pp. 535-546.
9. Y. Li, C. Yu, and H. V. Jagadish, "Schema-free xquery," in VLDB, 2004, pp. 72-83.
10. Z. Liu and Y. Chen, "Identifying meaningful return information for xml keyword search," in SIGMOD Conference, 2007, pp. 329-340.
11. C. Sun, C. Y. Chan, and A. K. Goenka, "Multiway slca-based keyword search in xml data," in WWW, 2007, pp. 1043-1052.
12. Z. Liu and Y. Chen, "Reasoning and identifying relevant matches for xml keyword search," PVLDB, vol. 1, no. 1, pp. 921-932, 2008.
13. S. Amer-Yahia and M. Lalmas, "Xml search: languages, inex and scoring," SIGMOD Record, vol. 35, no. 4, pp. 16-23, 2006.
14. R. Fagin, A. Lotem, and M. Naor, "Optimal aggregation algorithms for middleware," in PODS, 2001.
15. M. Theobald, R. Schenkel, and G. Weikum, "An efficient and versatile query engine for topx search," in VLDB, 2005, pp. 625-636.
16. S. Amer-Yahia, E. Curtmola, and A. Deutsch, "Flexible and efficient xml search with complex full-text predicates," in SIGMOD Conference, 2006, pp. 575-586.
17. S. Amer-Yahia, C. Botev, and J. Shanmugasundaram, "Texquery: a full-text search extension to xquery," in WWW, 2004, pp. 583-594.
18. R. A. Baeza-Yates and B. A. Ribeiro-Neto, Modern Information Retrieval. ACM Press / Addison-Wesley, 1999.
19. M. Stonebraker, D. J. Abadi, A. Batkin, X. Chen, M. Cherniack, M. Ferreira, E. Lau, A. Lin, S. Madden, E. J. O'Neil, P. E. O'Neil, A. Rasin, N. Tran, and S. B. Zdonik, "C-store: A column-oriented dbms," in VLDB, 2005, pp. 553-564.
20. D. J. Abadi, S. Madden, and M. Ferreira, "Integrating compression and execution in column-oriented database systems," in SIGMOD Conference, 2006, pp. 671-682.
21. I. F. Ilyas, W. G. Aref, and A. K. Elmagarmid, "Supporting top-k join queries in relational databases," in VLDB, 2003, pp. 754-765.
22. V. Hristidis, L. Gravano, and Y. Papakonstantinou, "Efficient ir-style keyword search over relational databases," in VLDB, 2003, pp. 850-861.
23. F. Shao, L. Guo, C. Botev, A. Bhaskar, M. M. M. Chettiar, F. Y. 0002, and J. Shanmugasundaram, "Efficient keyword search over virtual xml views," in VLDB, 2007, pp. 1057-1068.
24. V. Hristidis, Y. Papakonstantinou, and A. Balmin, "Keyword proximity search on xml graphs," in ICDE, 2003, pp. 367-378.
25. Y. Luo, X. Lin, W. Wang, and X. Zhou, "Spark: top-k keyword query in relational databases," in SIGMOD Conference, 2007, pp. 115-126.
26. K. C.-C. Chang and S. won Hwang, "Minimal probing: supporting expensive predicates for top-k queries," in SIGMOD Conference, 2002, pp. 346-357.
27. H. Bast, D. Majumdar, R. Schenkel, M. Theobald, and G. Weikum, "Iotop-k: Index-access optimized top-k query processing," in VLDB, 2006, pp. 475-486.
28. N. Mamoulis, K. H. Cheng, M. L. Yiu, and D. W. Cheung, "Efficient aggregation of ranked inputs," in ICDE, 2006, p. 72.
29. D. Xin, J. Han, and K. C.-C. Chang, "Progressive and selective merge: computing top-k with ad-hoc ranking functions," in SIGMOD Conference, 2007, pp. 103-114.
30. V. Hristidis, N. Koudas, and Y. Papakonstantinou, "Prefer: A system for the efficient execution of multi-parametric ranked queries," in SIGMOD Conference, 2001, pp. 259-270.
31. G. Das, D. Gunopulos, N. Koudas, and D. Tsirogiannis, "Answering top-k queries using views," in VLDB, 2006, pp. 451-462.
32. N. Bansal, S. Guha, and N. Koudas, "Ad-hoc aggregations of ranked lists in the presence of hierarchies," in SIGMOD Conference, 2008, pp. 67-78.