Sciweavers

151 search results - page 21 / 31
» SIGOPT: Using Schema to Optimize XML Query Processing
Sort
View
CIKM
1999
Springer
13 years 11 months ago
Requirement-Based Data Cube Schema Design
On-line analytical processing (OLAP) requires e cient processing of complex decision support queries over very large databases. It is well accepted that pre-computed data cubes ca...
David Wai-Lok Cheung, Bo Zhou, Ben Kao, Hongjun Lu...
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
14 years 6 months ago
ViewJoin: Efficient View-based Evaluation of Tree Pattern Queries
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
Ding Chen, Chee-Yong Chan
VLDB
2005
ACM
139views Database» more  VLDB 2005»
14 years 6 days ago
Tree-Pattern Queries on a Lightweight XML Processor
Popular XML languages, like XPath, use “treepattern” queries to select nodes based on their structural characteristics. While many processing methods have already been propose...
Mirella Moura Moro, Zografoula Vagena, Vassilis J....
WEBDB
2001
Springer
113views Database» more  WEBDB 2001»
13 years 11 months ago
Indexing XML Data with ToXin
Indexing schemes for semistructured data have been developed in recent years to optimize path query processing by summarizing path information. However, most of these schemes can ...
Flavio Rizzolo, Alberto O. Mendelzon
EDBT
2010
ACM
149views Database» more  EDBT 2010»
13 years 12 months ago
Statistics-based parallelization of XPath queries in shared memory systems
The wide availability of commodity multi-core systems presents an opportunity to address the latency issues that have plaqued XML query processing. However, simply executing multi...
Rajesh Bordawekar, Lipyeow Lim, Anastasios Kements...