Sciweavers

GRID
2007
Springer
13 years 8 months ago
Optimizing multiple queries on scientific datasets with partial replicas
We propose strategies to efficiently execute a query workload, which consists of multiple related queries submitted against a scientific dataset, on a distributed-memory system in...
Li Weng, Ümit V. Çatalyürek, Tahs...
ESCIENCE
2007
IEEE
13 years 8 months ago
A Scalable and Efficient Prefix-Based Lookup Mechanism for Large-Scale Grids
Data sources, storage, computing resources and services are entities on Grids that require mechanisms for publication and lookup. A discovery service relies on efficient lookup to...
Philip Chan, David Abramson
VLDB
1994
ACM
120views Database» more  VLDB 1994»
13 years 8 months ago
Indexing Multiple Sets
Index structures for multiple sets can be classified into those that group entries according to their key values and those that group entries according to their set membership. Th...
Christoph Kilger, Guido Moerkotte
VLDB
1998
ACM
87views Database» more  VLDB 1998»
13 years 8 months ago
Fast High-Dimensional Data Search in Incomplete Databases
We propose and evaluate two indexing schemes for improving the efficiency of data retrieval in high-dimensional databases that are incomplete. These schemes are novel in that the ...
Beng Chin Ooi, Cheng Hian Goh, Kian-Lee Tan
SIGMOD
1998
ACM
117views Database» more  SIGMOD 1998»
13 years 8 months ago
The Pyramid-Technique: Towards Breaking the Curse of Dimensionality
In this paper, we propose the Pyramid-Technique, a new indexing method for high-dimensional data spaces. The PyramidTechnique is highly adapted to range query processing using the...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
ICDT
1999
ACM
72views Database» more  ICDT 1999»
13 years 8 months ago
On the Generation of 2-Dimensional Index Workloads
A large number of database index structures have been proposed over the last two decades, and little consensus has emerged regarding their relative e ectiveness. In order to empir...
Joseph M. Hellerstein, Lisa Hellerstein, George Ko...
ICDT
2001
ACM
153views Database» more  ICDT 2001»
13 years 9 months ago
Estimating Range Queries Using Aggregate Data with Integrity Constraints: A Probabilistic Approach
In fast OLAP applications it is often advantageous to provide approximate answers to range queries in order to achieve very high performances. A possible solution is to inquire sum...
Francesco Buccafurri, Filippo Furfaro, Domenico Sa...
MDM
2010
Springer
177views Communications» more  MDM 2010»
13 years 9 months ago
Supporting Continuous Range Queries in Indoor Space
—Range query processing is an important technology in spatial databases. Current studies mainly focus on range queries in outdoor space based on the Euclidean or network distance...
Wenjie Yuan, Markus Schneider
WEBDB
2004
Springer
81views Database» more  WEBDB 2004»
13 years 10 months ago
Querying Peer-to-Peer Networks Using P-Trees
We propose a new distributed, fault-tolerant peer-to-peer index structure called the P-tree. P-trees efficiently evaluate range queries in addition to equality queries.
Adina Crainiceanu, Prakash Linga, Johannes Gehrke,...
MDM
2004
Springer
138views Communications» more  MDM 2004»
13 years 10 months ago
Optimizing Data Placement over Wireless Broadcast Channel for Multi-Dimensional Range Query Processing
Data broadcasting is well known for its excellent scalability. Multi-dimensional range queries, such as spatial range queries of geographical information for location dependent se...
Jianting Zhang, Le Gruenwald