Sciweavers

348 search results - page 1 / 70
» An Efficient Index Lattice for XML Query Evaluation
Sort
View
DASFAA
2007
IEEE
141views Database» more  DASFAA 2007»
13 years 8 months ago
An Efficient Index Lattice for XML Query Evaluation
Abstract. We have defined an XML structural index called the Structure Index Tree (SIT), which eliminates duplicate structures arising from the equivalent subtrees in an XML docume...
Wilfred Ng, James Cheng
SYRCODIS
2007
92views Database» more  SYRCODIS 2007»
13 years 5 months ago
A Method for Evaluating Full-text Search Queries in Native XML Databases
In this paper we consider the problem of efficiently producing results for full-text keyword search queries over XML documents. We describe full-text search query semantics and pr...
Roman Pastukhov
DATESO
2010
233views Database» more  DATESO 2010»
13 years 2 months ago
Efficient Implementation of XPath Processor on Multi-Core CPUs
Abstract. Current XPath processors use direct approach to query evaluation which is quite inefficient in some cases and usually implemented serially. This may be a problem in case ...
Martin Krulis, Jakub Yaghob
ICDE
2003
IEEE
155views Database» more  ICDE 2003»
14 years 5 months ago
XR-Tree: Indexing XML Data for Efficient Structural Joins
XML documents are typically queried with a combination of value search and structure search. While querying by values can leverage traditional database technologies, evaluating st...
Haifeng Jiang, Hongjun Lu, Wei Wang 0011, Beng Chi...
WWW
2006
ACM
14 years 5 months ago
FLUX: fuzzy content and structure matching of XML range queries
An XML range query may impose predicates on the numerical or textual contents of the elements and/or their respective path structures. In order to handle content and structure ran...
Hua-Gang Li, S. Alireza Aghili, Divyakant Agrawal,...