Sciweavers

1018 search results - page 27 / 204
» On the minimization of XPath queries
Sort
View
WWW
2008
ACM
14 years 11 months ago
Divide, Compress and Conquer: Querying XML via Partitioned Path-Based Compressed Data Blocks
We propose a novel Partition Path-Based (PPB) grouping strategy to store compressed XML data in a stream of blocks. In addition, we employ a minimal indexing scheme called Block S...
Wilfred Ng, Ho Lam Lau, Aoying Zhou
85
Voted
PODS
2006
ACM
98views Database» more  PODS 2006»
15 years 12 months ago
Processing queries on tree-structured data efficiently
This is a survey of algorithms, complexity results, and general solution techniques for efficiently processing queries on tree-structured data. I focus on query languages that com...
Christoph Koch
KI
2004
Springer
15 years 5 months ago
Model Based Deduction for Database Schema Reasoning
Abstract. We aim to demonstrate that automated deduction techniques, in particular those following the model computation paradigm, are very well suited for database schema/query re...
Peter Baumgartner, Ulrich Furbach, Margret Gro&szl...
SOFSEM
2012
Springer
13 years 7 months ago
Randomized Group Testing Both Query-Optimal and Minimal Adaptive
The classical group testing problem asks to determine at most d defective elements in a set of n elements, by queries to subsets that return Yes if the subset contains some defecti...
Peter Damaschke, Azam Sheikh Muhammad
CIKM
2009
Springer
15 years 6 months ago
Towards non-directional Xpath evaluation in a RDBMS
XML query languages use directional path expressions to locate data in an XML data collection. They are tightly coupled to the structure of a data collection, and can fail when ev...
Sourav S. Bhowmick, Curtis E. Dyreson, Erwin Leona...