Efficient LCA based keyword search in XML data

Xu, Yu; Papakonstantinou, Yannis

doi:10.1145/1352431.1352496

Cited by 41 publications

(99 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…store (6) state (7) city (9) merchandises (13) shoe (14) fitting (15) men (16) store (33) state (34) city (36) merchandises (40) retailer (1) category (19) hiking (20) shoe (21) shoe (26) shoe (41) shoe (48) fitting (22) men (23) cut high (25) cut(29) fitting (27) women (28) low (30) category (31) running (32) cut (44) fitting (42) men (43) category (46) running (47) category (51) fitting (49) women (50) sandal (52) name (2) product (4) The North Face (3) footwear (5) low (45) cut (17) low (18) name (11) REI (12) name (38) Sports Authority (39) …… …… …… retailers (0) retailer (53) … root (0) states (54) state (55) state … name (56) Arizona …”

Section: Xml Data Modelmentioning

confidence: 99%

“…A number of LCA based approaches have been proposed, including XSEarch [9], MLCA [31], CVLCA [28], SLCA [53], ELCA [15,54], and MaxMatch [35], etc. The relationships of these approaches are shown in Figure 10.…”

Section: Lca Based Approachesmentioning

confidence: 99%

“…There are two types of query result definitions among LCA based approaches, which lead to different types of strategies in identifying relevant matches: multi-match semantics (including SLCA [53], ELCA [15,54], and MaxMatch [35]) and singlematch semantics (including XSEarch [9], MLCA [31] and CVLCA [28]). In multimatch semantics, each result may contain multiple matches to a keyword, while in single-match semantics, each result contains exactly one match to each keyword.…”

Section: Identif Ication Strategiesmentioning

confidence: 99%

“…Exclusive lowest common ancestor (ELCA) [15,54] ELCA is a superset of SLCA for a given query and data. It was first proposed in XRank [15], and was later named ELCA in [54].…”

Section: Definition 33 An Xml Node U Is An Slca Of a Abstractearch Ifmentioning

confidence: 99%

“…It was first proposed in XRank [15], and was later named ELCA in [54]. It is also adopted in [7,58].…”

Section: Definition 33 An Xml Node U Is An Slca Of a Abstractearch Ifmentioning

confidence: 99%

See 4 more Smart Citations

Processing keyword search on XML: a survey

Liu

Chen

2011

World Wide Web

View full text Add to dashboard Cite

Keyword search is a user-friendly approach for users to retrieve information from XML data. Since an XML document can have a large size and contain a lot of information, an XML keyword search result should be a fragment of an XML document dynamically constructed at query time, which is achievable due to the structuredness of XML. Processing keyword searches on XML has several challenges, e.g., what are the elements in the XML document that are relevant to the query? How to generate the results efficiently and rank the results meaningfully? How to present the results to the user in a way such that the user can quickly find the desired information? In this survey, we review the papers in the literature that attempted to address these problems. We divide the existing approaches into several classes based on the problem they tackled, and perform a comprehensive analysis of these works.

show abstract

Section: Xml Data Modelmentioning

confidence: 99%

Section: Lca Based Approachesmentioning

confidence: 99%

Section: Identif Ication Strategiesmentioning

confidence: 99%

“…Exclusive lowest common ancestor (ELCA) [15,54] ELCA is a superset of SLCA for a given query and data. It was first proposed in XRank [15], and was later named ELCA in [54].…”

Section: Definition 33 An Xml Node U Is An Slca Of a Abstractearch Ifmentioning

confidence: 99%

“…It was first proposed in XRank [15], and was later named ELCA in [54]. It is also adopted in [7,58].…”

Section: Definition 33 An Xml Node U Is An Slca Of a Abstractearch Ifmentioning

confidence: 99%

See 3 more Smart Citations

Processing keyword search on XML: a survey

Liu

Chen

2011

World Wide Web

View full text Add to dashboard Cite

show abstract

LAF: a new XML encoding and indexing strategy for keyword‐based XML search

Deng

Xiang

Gao

2012

Concurrency and Computation

View full text Add to dashboard Cite

As a large number of corpuses are represented, stored and published in XML format, how to find useful information from XML databases has become an increasingly important issue. Keyword search enables web users to easily access XML data without the need to learn a structured query language or to study complex data schemas. Most existing indexing strategies for XML keyword search are based upon Dewey encoding. In this paper, we proposed a new encoding method called Level Order and Father (LAF) for XML documents. With LAF encoding, we devised a new index structure, called two‐layer LAF inverted index, which can greatly decrease the space complexity compared with Dewey encoding‐based inverted index. Furthermore, with two‐layer LAF inverted index, we proposed a new keyword query algorithm called Algorithm based on Binary Search (ABS) that can quickly find all Smallest Lowest Common Ancestor. We experimentally evaluate two‐layer LAF inverted index and ABS algorithm on four real XML data sets selected from Wikipedia. The experimental results prove the advantages of our index method and querying algorithm. The space consumed by two‐layer LAF index is less than half of that consumed by Dewey inverted index. Moreover, ABS is about one to two orders of magnitude faster than the classic Stack algorithm. Concurrency and Computation: Practice and Experience, 2012.© 2012 Wiley Periodicals, Inc.

show abstract