Sciweavers

329 search results - page 5 / 66
» Efficient Processing of Multiple XML Twig 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
168views Database» more  DASFAA 2008»
14 years 2 months ago
SemanticTwig: A Semantic Approach to Optimize XML Query Processing
Twig pattern matching (TPM) is the core operation of XML query processing. Existing approaches rely on either efficient data structures or novel labeling/indexing schemes to reduce...
Zhifeng Bao, Tok Wang Ling, Jiaheng Lu, Bo Chen
WEBDB
2009
Springer
185views Database» more  WEBDB 2009»
14 years 2 months ago
Efficient and Scalable Sequence-Based XML Filtering
The ubiquitous adoption of XML as the standard of data exchange over the web has led to increased interest in building efficient and scalable XML publish-subscribe (pub-sub) syste...
Mariam Salloum, Vassilis J. Tsotras
CIKM
2009
Springer
14 years 2 months ago
Bitmap indexes for relational XML twig query processing
Due to an increasing volume of XML data, it is considered prudent to store XML data on an industry-strength database system instead of relying on a domain specific application or...
Kyong-Ha Lee, Bongki Moon
DATESO
2009
146views Database» more  DATESO 2009»
13 years 5 months ago
Compression of the Stream Array Data Structure
In recent years, many approaches to XML twig pattern query (TPQ) processing have been developed. Some algorithms are supported by a stream abstract data type. s an abstract data ty...
Radim Baca, Martin Pawlas