2889 search results - page 300 / 578 » Querying Structured Hyperdocuments |
124
click to vote
SIGMOD
2010
ACM
15 years 6 months ago
2010
ACM
In this paper we investigate techniques that allow for on-line updates to columnar databases, leaving intact their high read-only performance. Rather than keeping differential str...
200
click to vote
IJFCS
2002
15 years 5 months ago
2002
We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, small me...
179
click to vote
TODS
2002
15 years 5 months ago
2002
Metric access methods (MAMs), such as the M-tree, are powerful index structures for supporting ty queries on metric spaces, which represent a common abstraction for those searchin...
162
click to vote
SCHOLARPEDIA
2008
15 years 5 months ago
2008
A new method for automatic indexing and retrieval is described. The approach is to take advantage of implicit higher-order structure in the association of terms with documents (&q...
161
click to vote
ECCC
2010
15 years 3 months ago
2010
Locally testable codes, i.e., codes where membership in the code is testable with a constant number of queries, have played a central role in complexity theory. It is well known t...