Efficiently enumerating results of keyword search over data graphs

Information Systems

Volumn 33, Issue 4-5, 2008, Pages 335-359

  Kimelfeld, Benny ^a   Sagiv, Yehoshua ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Data graphs; Databases; Enumeration algorithms; Keyword search; Reduced subtrees

Indexed keywords

GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING; SEARCH ENGINES;

DATA GRAPHS; ENUMERATION ALGORITHMS; KEYWORD SEARCH; REDUCED SUBTREES;

DATABASE SYSTEMS;

EID: 43049103075     PISSN: 03064379     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.is.2008.01.002     Document Type: Article

References (35)

1. S. Agrawal, S. Chaudhuri, G. Das, DBXplorer: a system for keyword-based search over relational databases, in: 18th International Conference on Data Engineering (ICDE 2002), IEEE Computer Society, San Jose, California, USA, 2002.
2. G. Bhalotia, A. Hulgeri, C. Nakhe, S. Chakrabarti, S. Sudarshan, Keyword searching and browsing in databases using BANKS, in: 18th International Conference on Data Engineering (ICDE 2002), IEEE Computer Society, San Jose, California, USA, 2002.
3. V. Hristidis, Y. Papakonstantinou, DISCOVER: keyword search in relational databases, in: Proceedings of the 28th International Conference on Very Large Data Bases, Morgan Kaufmann, Hong Kong, China, 2002.
4. S. Wang, Z. Peng, J. Zhang, L. Qin, S. Wang, J.X. Yu, B. Ding, NUITS: a novel user interface for efficient keyword search over databases, in: Proceedings of the 32nd International Conference on Very Large Data Bases, ACM, Seoul, Korea, 2006.
5. B. Ding, J.X. Yu, S. Wang, L. Qin, X. Zhang, X. Lin, Finding top-k min-cost connected trees in databases, in: 2007 IEEE 23rd International Conference on Data Engineering, IEEE Computer Society, Istanbul, Turkey, 2007.
6. F. Liu, C.T. Yu, W. Meng, A. Chowdhury, Effective keyword search in relational databases, in: Proceedings of the 2006 ACM SIGMOD International Conference on Management of Data, ACM, Chicago, IL, USA, 2006.
7. V. Hristidis, Y. Papakonstantinou, A. Balmin, Keyword proximity search on XML graphs, in: 19th International Conference on Data Engineering (ICDE'03), IEEE Computer Society, Bangalore, India, 2003.
8. V. Kacholia, S. Pandit, S. Chakrabarti, S. Sudarshan, R. Desai, H. Karambelkar, Bidirectional expansion for keyword search on graph databases, in: Proceedings of the 31st International Conference on Very Large Data Bases, ACM, Trondheim, Norway, 2005.
9. B. Kimelfeld, Y. Sagiv, Efficient engines for keyword proximity search, in: Eighth International Workshop on the Web and Databases (WebDB 2005), Baltimore, Maryland, USA, 2005.
10. S. Cohen, Y. Kanza, B. Kimelfeld, Y. Sagiv, Interconnection semantics for keyword search in XML, in: Proceedings of the 14th ACM International Conference on Information and Knowledge Management, ACM, Bremen, Germany, 2005.
11. V. Hristidis, L. Gravano, Y. Papakonstantinou, Efficient IR-style keyword search over relational databases, in: Proceedings of the 29th International Conference on Very Large Data Bases, Morgan Kaufmann, Berlin, Germany, 2003.
12. B. Kimelfeld, Y. Sagiv, Finding and approximating top-k answers in keyword proximity search, in: Proceedings of the 25th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, ACM, Chicago, IL, USA, 2006.
13. W.S. Li, K.S. Candan, Q. Vu, D. Agrawal, Retrieving and organizing Web pages by "information unit", in: Proceedings of the 10th International Conference on World Wide Web, ACM, Hong Kong, China, 2001.
14. Johnson D.S., Papadimitriou C.H., and Yannakakis M. On generating all maximal independent sets. Inf. Process. Lett. 27 3 (1988) 119-123
15. Garey M.R., Graham R.L., and Johnson D.S. The complexity of computing Steiner minimal trees. SIAM J. Appl. Math. 32 4 (1977) 835-859
16. E. Halperin, R. Krauthgamer, Polylogarithmic inapproximability, in: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, ACM, San Diego, CA, USA, 2003.
17. M.Y. Vardi, The complexity of relational query languages (extended abstract), in: Proceedings of the 14th Annual ACM Symposium on Theory of Computing, ACM, San Francisco, CA, USA, 1982.
18. B. Kimelfeld, Y. Sagiv, Efficiently enumerating results of keyword search, in: Database Programming Languages, 10th International Symposium, DBPL 2005, Lecture Notes in Computer Science, vol. 3774, Springer, Trondheim, Norway, 2005.
19. R. Fagin, A. Lotem, M. Naor, Optimal aggregation algorithms for middleware, in: Proceedings of the 20th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, ACM, Santa Barbara, CA, USA, 2001.
20. Yen J.Y. Finding the k shortest loopless paths in a network. Manage. Sci. 17 11 (1971) 712-716
21. Lawler E.L. A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem. Manage. Sci. 18 7 (1972) 401-405
22. Downey R.G., and Fellows M.R. Parameterized Complexity, Monographs in Computer Science (1999), Springer, Berlin
23. B. Kimelfeld, Y. Sagiv, Maximally joining probabilistic data, in: Proceedings of the 26th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, ACM, Beijing, China, 2007.
24. C.D. Marlin, Coroutines: A Programming Methodology, a Language Design and an Implementation, Lecture Notes in Computer Science, vol. 95, Springer, Berlin, 1980.
25. S. Cohen, I. Fadida, Y. Kanza, B. Kimelfeld, Y. Sagiv, Full disjunctions: polynomial-delay iterators in action, in: Proceedings of the 32nd International Conference on Very Large Data Bases, ACM, Seoul, Korea, 2006.
26. Garcia-Molina H., Ullman J.D., and Widom J. Database Systems: The Complete Book (2001), Prentice-Hall PTR, Englewood Cliffs, NJ
27. Kou L.T., Markowsky G., and Berman L. A fast algorithm for Steiner trees. Acta Inf. 15 2 (1981) 141-145
28. Zelikovsky A. An 11/6-approximation algorithm for the network Steiner problem. Algorithmica 9 5 (1993) 463-470
29. V.M. Jiménez, A. Marzal, Computing the K shortest paths: a new algorithm and an experimental comparison, in: Algorithm Engineering: Third International Workshop, WAE'99, Lecture Notes in Computer Science, vol. 1668, Springer, London, UK, 1999.
30. S. Cohen, Y. Kanza, Y. Sagiv, Select-project queries over XML documents, in: Next Generation Information Technologies and Systems: Fifth International Workshop, NGITS 2002, Lecture Notes in Computer Science, vol. 2382, Springer, Caesarea, Israel, 2002.
31. S. Cohen, Y. Kanza, Y. Sagiv, Generating relations from XML documents, in: Database Theory-ICDT 2003: Ninth International Conference, Lecture Notes in Computer Science, vol. 2572, Springer, Siena, Italy, 2003.
32. S. Cohen, J. Mamou, Y. Kanza, Y. Sagiv, XSEarch: a semantic search engine for XML, in: Proceedings of the 29th International Conference on Very Large Data Bases, Morgan Kaufmann, Berlin, Germany, 2003.
33. N. Bruno, N. Koudas, D. Srivastava, Holistic twig joins: optimal XML pattern matching, in: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, ACM, Madison, Wisconsin, USA, 2002.
34. B. Kimelfeld, Y. Sagiv, Twig patterns: from XML trees to graphs, in: Ninth International Workshop on the Web and Databases (WebDB 2006), Chicago, IL, USA, 2006.
35. M. Yannakakis, Algorithms for acyclic database schemes, in: Proceedings of the Seventh International Conference on Very Large Data Bases, IEEE Computer Society, Cannes, France, 1981.