Sciweavers

241 search results - page 11 / 49
» Effective pruning for XML structural match queries
Sort
View
ICDE
2005
IEEE
131views Database» more  ICDE 2005»
14 years 8 months ago
On the Sequencing of Tree Structures for XML Indexing
Sequence-based XML indexing aims at avoiding expensive join operations in query processing. It transforms structured XML data into sequences so that a structured query can be answ...
Haixun Wang, Xiaofeng Meng
DASFAA
2006
IEEE
152views Database» more  DASFAA 2006»
14 years 1 months ago
Effective Keyword Search in XML Documents Based on MIU
Keyword search is an effective approach for most users to search for information because they do not need to learn complex query languages or the underlying structures of the data....
Jianjun Xu, Jiaheng Lu, Wei Wang 0009, Baile Shi
ICDE
2001
IEEE
128views Database» more  ICDE 2001»
14 years 8 months ago
Counting Twig Matches in a Tree
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
Zhiyuan Chen, H. V. Jagadish, Flip Korn, Nick Koud...
SIGMOD
2002
ACM
165views Database» more  SIGMOD 2002»
14 years 7 months ago
APEX: an adaptive path index for XML data
The emergence of the Web has increased interests in XML data. XML query languages such as XQuery and XPath use label paths to traverse the irregularly structured data. Without a s...
Chin-Wan Chung, Jun-Ki Min, Kyuseok Shim
ICDE
2010
IEEE
262views Database» more  ICDE 2010»
14 years 7 months ago
Approximate String Search in Spatial Databases
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
Bin Yao, Feifei Li, Marios Hadjieleftheriou, Kun H...