Sciweavers

1890 search results - page 158 / 378
» Querying Big Data by Accessing Small Data
Sort
View
NBIS
2007
Springer
16 years 20 days ago
Implementing Range Queries with a Decentralized Balanced Tree over Distributed Hash Tables
Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we...
Nuno Lopes, Carlos Baquero
SIGMOD
2001
ACM
124views Database» more  SIGMOD 2001»
16 years 6 months ago
Query Optimization In Compressed Database Systems
Over the last decades, improvements in CPU speed have outpaced improvements in main memory and disk access rates by orders of magnitude, enabling the use of data compression techn...
Zhiyuan Chen, Johannes Gehrke, Flip Korn
EDBT
2006
ACM
255views Database» more  EDBT 2006»
16 years 6 months ago
FIS-by-Step: Visualization of the Fast Index Scan for Nearest Neighbor Queries
Abstract. Many different index structures have been proposed for spatial databases to support efficient query processing. However, most of these index structures suffer from an exp...
Elke Achtert, Dominik Schwald
SSDBM
1999
IEEE
135views Database» more  SSDBM 1999»
15 years 10 months ago
Query Processing in the TAMBIS Bioinformatics Source Integration System
Conducting bioinformatic analyses involves biologists in expressing requests over a range of highly heterogeneous information sources and software tools. Such activities are labor...
Norman W. Paton, Robert Stevens, Patricia G. Baker...
CIKM
2009
Springer
16 years 1 months ago
Workload-aware trie indices for XML
Well-designed indices can dramatically improve query performance. Including query workload information can produce indices that yield better overall throughput while balancing the...
Yuqing Wu, Sofia Brenes, Hyungdae Yi