Sciweavers

806 search results - page 14 / 162
» An Optimal Dynamic Data Structure for Stabbing-Semigroup Que...
Sort
View
VLDB
1999
ACM
89views Database» more  VLDB 1999»
15 years 4 months ago
Physical Data Independence, Constraints, and Optimization with Universal Plans
We present an optimization method and algorithm designed for three objectives: physical data independence, semantic optimization, and generalized tableau minimization. The method ...
Alin Deutsch, Lucian Popa, Val Tannen
APWEB
2004
Springer
15 years 5 months ago
Labeling and Querying Dynamic XML Trees
Abstract With the growing importance of XML in data exchange, much research tends to provide a compact labeling scheme and a flexible query facility to extract data from dynamic XM...
Jiaheng Lu, Tok Wang Ling
ICDE
2010
IEEE
273views Database» more  ICDE 2010»
15 years 11 months ago
WikiAnalytics: Ad-hoc Querying of Highly Heterogeneous Structured Data
Searching and extracting meaningful information out of highly heterogeneous datasets is a hot topic that received a lot of attention. However, the existing solutions are based on e...
Andrey Balmin, Emiran Curtmola
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
15 years 1 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...
CCGRID
2002
IEEE
15 years 4 months ago
Multiple Query Optimization for Data Analysis Applications on Clusters of SMPs
This paper is concerned with the efficient execution of multiple query workloads on a cluster of SMPs. We target applications that access and manipulate large scientific dataset...
Henrique Andrade, Tahsin M. Kurç, Alan Suss...