Sciweavers

741 search results - page 114 / 149
» Memory Dependence Prediction Using Store Sets
Sort
View
PODS
2009
ACM
130views Database» more  PODS 2009»
16 years 2 months ago
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
Rasmus Pagh, Srinivasa Rao Satti
185
Voted
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
16 years 2 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray
ALGORITHMICA
2002
103views more  ALGORITHMICA 2002»
15 years 1 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...
POPL
2008
ACM
16 years 2 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume
121
Voted
CIVR
2007
Springer
119views Image Analysis» more  CIVR 2007»
15 years 8 months ago
An in-memory relevance feedback technique for high-performance image retrieval systems
Content-based image retrieval with relevant feedback has been widely adopted as the query model of choice for improved effectiveness in image retrieval. The effectiveness of thi...
Ning Yu, Khanh Vu, Kien A. Hua