Sciweavers

25 search results - page 2 / 5
» Structural Joins: A Primitive for Efficient XML Query Patter...
Sort
View
DEXA
2006
Springer
139views Database» more  DEXA 2006»
13 years 11 months ago
Efficient Processing of Multiple XML Twig Queries
Abstract. Finding all occurrences of a twig pattern in an XML document is a core operation for XML query processing. The emergence of XML as a common mark-up language for data inte...
Huanzhang Liu, Tok Wang Ling, Tian Yu, Ji Wu
DEXA
2005
Springer
117views Database» more  DEXA 2005»
14 years 1 months ago
Efficient Processing of Ordered XML Twig Pattern
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. Holistic twig join algorithm has showed its superiorit...
Jiaheng Lu, Tok Wang Ling, Tian Yu, Changqing Li, ...
SIGMOD
2003
ACM
174views Database» more  SIGMOD 2003»
14 years 8 months ago
ViST: A Dynamic Index Method for Querying XML Data by Tree Structures
With the growing importance of XML in data exchange, much research has been done in providing flexible query facilities to extract data from structured XML documents. In this pape...
Haixun Wang, Sanghyun Park, Wei Fan, Philip S. Yu
SSDBM
2006
IEEE
197views Database» more  SSDBM 2006»
14 years 1 months ago
InterJoin: Exploiting Indexes and Materialized Views in XPath Evaluation
XML has become the standard for data exchange for a wide variety of applications, particularly in the scientific community. In order to efficiently process queries on XML repres...
Derek Phillips, Ning Zhang 0002, Ihab F. Ilyas, M....
DEXA
2006
Springer
136views Database» more  DEXA 2006»
13 years 11 months ago
Faster Twig Pattern Matching Using Extended Dewey ID
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. Recently, Lu et al. [7] proposed the TJFast algorithm ...
Chung Keung Poon, Leo Yuen