Proceedings of the 2011 ACM SIGMOD International Conference on Management of Data 2011
DOI: 10.1145/1989323.1989385
|View full text |Cite
|
Sign up to set email alerts
|

Nearest keyword search in XML documents

Abstract: This paper studies the nearest keyword (NK) problem on XML documents. In general, the dataset is a tree where each node is associated with one or more keywords. Given a node q and a keyword w, an NK query returns the node that is nearest to q among all the nodes associated with w. NK search is not only useful as a standalone operator but also as a building brick for important tasks such as XPath query evaluation and keyword search. We present an indexing scheme that answers NK queries efficiently, in terms of … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
23
0

Year Published

2012
2012
2015
2015

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 36 publications
(23 citation statements)
references
References 41 publications
0
23
0
Order By: Relevance
“…In the literature, [1] and [22] design different indexing schemes to process (top-k) nearest keyword queries on a graph or a tree. We introduce the two methods in the following two subsections.…”
Section: Existing Solutionsmentioning
confidence: 99%
See 4 more Smart Citations
“…In the literature, [1] and [22] design different indexing schemes to process (top-k) nearest keyword queries on a graph or a tree. We introduce the two methods in the following two subsections.…”
Section: Existing Solutionsmentioning
confidence: 99%
“…Tao et al [22] compute the exact answer to a 1-NK query on a tree T (V, E). Given a query Q = (q, λ, 1), the result is the nearest node in T that contains keyword λ, denoted as NN(q, λ).…”
Section: Exact 1-nk On a Treementioning
confidence: 99%
See 3 more Smart Citations