Sciweavers

148 search results - page 5 / 30
» Query Evaluation via Tree-Decompositions
Sort
View
WWW
2008
ACM
13 years 7 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
CIKM
2009
Springer
14 years 1 months ago
Reducing the risk of query expansion via robust constrained optimization
We introduce a new theoretical derivation, evaluation methods, and extensive empirical analysis for an automatic query expansion framework in which model estimation is cast as a r...
Kevyn Collins-Thompson
DIAGRAMS
2006
Springer
13 years 11 months ago
Evaluation of ERST - An External Representation Selection Tutor
This paper describes the evaluation of ERST, an adaptive system which is designed to improve its users' external representation (ER) selection accuracy on a range of database ...
Beate Grawemeyer
ICDT
2012
ACM
293views Database» more  ICDT 2012»
11 years 9 months ago
On the complexity of query answering over incomplete XML documents
Previous studies of incomplete XML documents have identified three main sources of incompleteness – in structural information, data values, and labeling – and addressed data ...
Amélie Gheerbrant, Leonid Libkin, Tony Tan
VLDB
2001
ACM
108views Database» more  VLDB 2001»
13 years 11 months ago
Hyperqueries: Dynamic Distributed Query Processing on the Internet
In this paper we propose a new framework for dynamic distributed query processing based on so-called HyperQueries which are essentially query evaluation sub-plans “sitting behin...
Alfons Kemper, Christian Wiesner