Sciweavers

286 search results - page 48 / 58
» Using MEMS-Based Storage to Boost Disk Performance
Sort
View
CIKM
2005
Springer
15 years 3 months ago
Rotation invariant indexing of shapes and line drawings
We present data representations, distance measures and organizational structures for fast and efficient retrieval of similar shapes in image databases. Using the Hough Transform w...
Michail Vlachos, Zografoula Vagena, Philip S. Yu, ...
ICPADS
1998
IEEE
15 years 1 months ago
Probability Based Replacement Algorithm for WWW Server Arrays
This paper describes a scalable Web server array architecture which uses a caching policy called Probability Based Replacement (PBR) algorithm [5, 6]. The server array consists of...
K. H. Yeung, K. W. Suen
78
Voted
ADC
2000
Springer
182views Database» more  ADC 2000»
15 years 1 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...
77
Voted
ALGORITHMICA
2002
103views more  ALGORITHMICA 2002»
14 years 9 months ago
Efficient Bulk Operations on Dynamic R-Trees
In recent years there has been an upsurge of interest in spatial databases. A major issue is how to manipulate efficiently massive amounts of spatial data stored on disk in multidi...
Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey...
SIGMOD
2008
ACM
158views Database» more  SIGMOD 2008»
15 years 9 months ago
Column-stores vs. row-stores: how different are they really?
There has been a significant amount of excitement and recent work on column-oriented database systems ("column-stores"). These database systems have been shown to perfor...
Daniel J. Abadi, Samuel Madden, Nabil Hachem