Interconnection semantics for keyword search in XML

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2005, Pages 389-396

  Cohen, Sara ^a   Kanza, Yaron ^b   Kimelfeld, Benny ^c   Sagiv, Yehoshua ^c  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF TORONTO   (Canada)

^c HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Interconnection semantics; Keyword search; XML

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA PROCESSING; PROBLEM SOLVING; PROGRAM DOCUMENTATION; REAL TIME SYSTEMS; SEMANTICS;

INTERCONNECTION SEMANTICS; KEYWORD SEARCH; REAL-WORLD XML DOCUMENTS; XML DATA;

XML;

EID: 33745794959     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1099554.1099674     Document Type: Conference Paper

References (21)

1. S. Agrawal, S. Chaudhuri, and G. Das. DBXplorer: A system for keyword-based search over relational databases. In ICDE, pages 5-16, 2002.
2. M. Barg and R. Wong. Structural proximity searching for large collections of semi-structured data. In CIKM, pages 175-182, 2001.
3. G. Bhalotia, A. Hulgeri, C. Nakhe, S. Chakrabarti, and S. Sudarshan. Keyword searching and browsing in databases using BANKS. In ICDE, pages 431-440, 2002.
4. S. Cohen, Y. Kanza, J. Mamou, and Y. Sagiv. XSEarch: a semantic search engine for XML. In VLDB, pages 45-56, 2003.
5. S. Cohen, Y. Kanza, and Y. Sagiv. Generating relations from XML documents. In ICDT, pages 285-299, 2003.
6. S. Dreyfus and R. Wagner. The Steiner problem in graphs. Networks, 1:195-207, 1972.
7. S. Fortune, J. Hopcroft, and J. Wyllie. The directed subgraph homeomorphism problem. Theoretical Computer Science, 10:11-121, 1980.
8. R. Goldman, N. Shivakumar, S. Venkatasubramanian, and H. Garcia-Molina. Proximity search in databases. In VLDB, pages 26-37, 1998.
9. V. Hristidis and Y. Papakonstantinou. DISCOVER: Keyword search in relational databases. In VLDB, pages 670-681, 2002.
10. V. Hristidis, Y. Papakonstantinou, and A. Balmin. Keyword proximity search on XML graphs. In ICDE, pages 367-378, 2003.
11. F. Hwang, D. Richards, and P. Winter. The Steiner Tree Problem, volume 53 of Annals of Discrete Mathematics, North-Holland, 1992.
12. D. Johnson, M. Yannakakis, and C. Papadimitriou. On generating all maximal independent sets. Information Processing Letters, 27:119-123, March 1988.
13. R. Karp. On the complexity of combinatorial problems. Networks, 5:44-68, 1975.
14. B. Kimelfeld. Interconnection semantics for XML. Master's thesis, The Hebrew University of Jerusalem, 2004. Available at the author's home page (http://www.cs.huji.ac.il/~bennyk).
15. B. Kimelfeld and Y. Sagiv. Efficient engines for keyword proximity search. In WebDB, pages 67-72, 2005.
16. B. Kimelfeld and Y. Sagiv. Efficiently enumerating results of keyword search. In DBPL, 2005.
17. Y. Li, C. Yu, and H. V. Jagadish. Schema-free XQuery. In VLDB, 2004.
18. A. Rajaraman and J. Ullman. Querying websites using compact skeletons. In PODS, pages 16-27, 2001.
19. N. Robertson and P. Seymour. Graph minors. XIII. The disjoint paths problem. Journal of Combinatorial Theory Series B, 63(1):65-110, 1995.
20. M. Y. Vardi. The complexity of relational query languages. In STOC, pages 137-146, 1982.
21. M. Yannakakis. Algorithms for acyclic database schemas. In VLDB, pages 82-94, 1981.