11211 search results - page 1915 / 2243 » Rank-Sensitive Data Structures |
194
click to vote
SIGMOD
2007
ACM
16 years 4 months ago
2007
ACM
We propose to demonstrate EaseDB, the first cache-oblivious query processor for in-memory relational query processing. The cacheoblivious notion from the theory community refers t...
219
Voted
SIGMOD
2006
ACM
16 years 4 months ago
2006
ACM
There has been a great deal of interest in the past few years on ranking of results of queries on structured databases, including work on probabilistic information retrieval, rank...
218
Voted
SIGMOD
2006
ACM
16 years 4 months ago
2006
ACM
To enable efficient similarity search in large databases, many indexing techniques use a linear transformation scheme to reduce dimensions and allow fast approximation. In this re...
227
Voted
SIGMOD
2005
ACM
16 years 4 months ago
2005
ACM
Immortal DB builds transaction time database support into the SQL Server engine, not in middleware. Transaction time databases retain and provide access to prior states of a datab...
175
click to vote
SIGMOD
2003
ACM
16 years 4 months ago
2003
ACM
We consider the problem of efficiently producing ranked results for keyword search queries over hyperlinked XML documents. Evaluating keyword search queries over hierarchical XML ...