Sciweavers

184 search results - page 1 / 37
» Efficient Range Query Retrieval for Non-Uniform Data Distrib...
Sort
View
ADC
2000
Springer
182views Database» more  ADC 2000»
13 years 8 months ago
Efficient Range Query Retrieval for Non-Uniform Data Distributions
Answering range queries is a common database operation. Methods based on hashing techniques to minimise the cost of answering range queries by taking the query distribution into a...
Salahadin Mohammed, Evan P. Harris, Kotagiri Ramam...
ICDE
1987
IEEE
81views Database» more  ICDE 1987»
13 years 8 months ago
Multidimensional Dynamic Quantile Hashing is Very Efficient for Non-Uniform Record Distributions
: Previous multidimensional dynamic hashing schemes exhibit two obvious shortcomings. First, even for uniform record distribution, the retrieval performance of these schemes suffer...
Hans-Peter Kriegel, Bernhard Seeger
DPD
2006
141views more  DPD 2006»
13 years 5 months ago
Efficient parallel processing of range queries through replicated declustering
A common technique used to minimize I/O in data intensive applications is data declustering over parallel servers. This technique involves distributing data among several disks so...
Hakan Ferhatosmanoglu, Ali Saman Tosun, Guadalupe ...
DATESO
2009
119views Database» more  DATESO 2009»
13 years 2 months ago
Efficiency Improvement of Narrow Range Query Processing in R-tree
Indexing methods for efficient processing of multidimensional data are very requested in many fields, like geographical information systems, drawing documentations etc. Well-known ...
Peter Chovanec, Michal Krátký
SIGMOD
2008
ACM
188views Database» more  SIGMOD 2008»
14 years 5 months ago
Just-in-time query retrieval over partially indexed data on structured P2P overlays
Structured peer-to-peer (P2P) overlays have been successfully employed in many applications to locate content. However, they have been less effective in handling massive amounts o...
Sai Wu, Jianzhong Li, Beng Chin Ooi, Kian-Lee Tan