Keyword proximity search on XML graphs

By Vagelis Hristidis, Yannis Papakonstantinou, Andrey Balmin. Proceedings / International Conference on Data Engineering, 2003

305 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

XSEarch: A Semantic Search Engine for XML (2003, methodology): “In [2, 13], it is suggested to rank query answers according to the distance in the document between the diﬀerent document elements that satisfy a query.”
ObjectRank: Authority-Based Keyword Search in Databases (2004, methodology): “Recent works [6, 19, 20, 5] on keyword search on databases, where the result is a tree of objects, either use similar IR techniques [6], or use the simpler boolean semantics [19, 20, 5], where the score of an attribute is 1 (0) if it contains (does not contain) the keywords.”
Efficient keyword search for smallest LCAs in XML databases (2005, background): “Discover [15], DBXplorer [1] and XKeyword [16] perform keyword search on relational databases, modeled as graphs.”
Schema-Free XQuery (2004, methodology): “Similar approach has also been taken to apply keyword search in XML documents (e.g., XKeyword [17] and XRANK [15]).”
Efficient IR-Style Keyword Search over Relational Databases (2003, methodology): “This approach is an adaptation of the execution algorithms of prior work [11, 1, 12] for keyword-search queries.”
EASE: an effective 3-in-1 keyword search method for unstructured, semi-structured and structured data (2008, background): “nized the benefits of keyword search and has been introducing keyword search capability into relational databases [1, 2, 6, 13, 15, 20, 22, 23], XML databases [4, 11, 14, 16, 19, 21, 25, 28] and graph databases [10, 12, 17].”