Sciweavers

148 search results - page 12 / 30
» Evaluation of Queries on Tree-Structured Data Using Dimensio...
Sort
View
WWW
2008
ACM
14 years 8 months ago
SPARQL basic graph pattern optimization using selectivity estimation
In this paper, we formalize the problem of Basic Graph Pattern (BGP) optimization for SPARQL queries and main memory graph implementations of RDF data. We define and analyze the c...
Markus Stocker, Andy Seaborne, Abraham Bernstein, ...
PVLDB
2008
174views more  PVLDB 2008»
13 years 7 months ago
Relaxation in text search using taxonomies
In this paper we propose a novel document retrieval model in which text queries are augmented with multi-dimensional taxonomy restrictions. These restrictions may be relaxed at a ...
Marcus Fontoura, Vanja Josifovski, Ravi Kumar, Chr...
PODS
2002
ACM
138views Database» more  PODS 2002»
14 years 7 months ago
Fast Algorithms For Hierarchical Range Histogram Construction
Data Warehousing and OLAPapplications typically view data as having multiple logical dimensions e.g., product, location with natural hierarchies de ned on each dimension. OLAP que...
Sudipto Guha, Nick Koudas, Divesh Srivastava
IPSN
2009
Springer
14 years 2 months ago
Approximating sensor network queries using in-network summaries
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
Alexandra Meliou, Carlos Guestrin, Joseph M. Helle...
PLDI
1995
ACM
13 years 11 months ago
APT: A Data Structure for Optimal Control Dependence Computation
The control dependence relation is used extensively in restructuring compilers. This relation is usually represented using the control dependence graph; unfortunately, the size of...
Keshav Pingali, Gianfranco Bilardi