Sciweavers

241 search results - page 6 / 49
» Effective pruning for XML structural match queries
Sort
View
DASFAA
2004
IEEE
138views Database» more  DASFAA 2004»
13 years 11 months ago
Counting Relaxed Twig Matches in a Tree
Abstract. We consider the problem of accurately estimating the number of approximate XML answers for a given query, and propose an efficient method that (1) accurately computes sel...
Dongwon Lee, Divesh Srivastava
DASFAA
2008
IEEE
151views Database» more  DASFAA 2008»
13 years 9 months ago
Efficient Top-k Search Across Heterogeneous XML Data Sources
An important issue arising from XML query relaxation is how to efficiently search the top-k best answers from a large number of XML data sources, while minimizing the searching cos...
Jianxin Li, Chengfei Liu, Jeffrey Xu Yu, Rui Zhou
DASFAA
2007
IEEE
141views Database» more  DASFAA 2007»
13 years 11 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
DEXA
2005
Springer
138views Database» more  DEXA 2005»
14 years 1 months ago
Full-Text and Structural XML Indexing on B+-Tree
XML query processing is one of the most active areas of database research. Although the main focus of past research has been the processing of structural XML queries, there are gro...
Toshiyuki Shimizu, Masatoshi Yoshikawa
SIGMOD
2007
ACM
125views Database» more  SIGMOD 2007»
14 years 7 months ago
Identifying meaningful return information for XML keyword search
Keyword search enables web users to easily access XML data without the need to learn a structured query language and to study possibly complex data schemas. Existing work has addr...
Ziyang Liu, Yi Chen