277 search results - page 32 / 56 » Opportunistic Data Structures for Range Queries |
PVLDB
2008
13 years 8 months ago
2008
Time series data is common in many settings including scientific and financial applications. In these applications, the amount of data is often very large. We seek to support pred...
DCG
2010
13 years 9 months ago
2010
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...
SIGMOD
2009
ACM
14 years 9 months ago
2009
ACM
Database outsourcing requires that a query server constructs a proof of result correctness, which can be verified by the client using the data owner's signature. Previous aut...
PODS
2006
ACM
14 years 9 months ago
2006
ACM
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
SIGMOD
2009
ACM
14 years 9 months ago
2009
ACM
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...