Sciweavers

101 search results - page 20 / 21
» Partitioning techniques for fine-grained indexing
Sort
View
SIGMOD
2010
ACM
267views Database» more  SIGMOD 2010»
13 years 10 months ago
Processing proximity relations in road networks
Applications ranging from location-based services to multi-player online gaming require continuous query support to monitor, track, and detect events of interest among sets of mov...
Zhengdao Xu, Hans-Arno Jacobsen
SIGMOD
2008
ACM
158views Database» more  SIGMOD 2008»
14 years 5 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
CBMS
2006
IEEE
13 years 11 months ago
A Framework for Web-Based Interactive Applications of High-Resolution 3D Medical Image Data
With the advances in medical imaging devices, large volumes of high-resolution 3D medical image data have been produced. These high-resolution 3D data are very large in size, and ...
Danzhou Liu, Kien A. Hua, Kiminobu Sugaya
MICRO
2003
IEEE
96views Hardware» more  MICRO 2003»
13 years 10 months ago
Scalable Hardware Memory Disambiguation for High ILP Processors
This paper describes several methods for improving the scalability of memory disambiguation hardware for future high ILP processors. As the number of in-flight instructions grows...
Simha Sethumadhavan, Rajagopalan Desikan, Doug Bur...
PAMI
2008
152views more  PAMI 2008»
13 years 5 months ago
K-Nearest Neighbor Finding Using MaxNearestDist
Abstract-Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth-first or a ...
Hanan Samet