11214 search results - page 4 / 2243 » Just-in-time data structures |
SIAMCOMP
1998
13 years 9 months ago
1998
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
PVLDB
2010
13 years 8 months ago
2010
We present in this paper ObjectRunner, a system for extracting, integrating and querying structured data from the Web. Our system harvests real-world items from template-based HTM...
TOIS
2002
13 years 9 months ago
2002
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
VLDB
2002
ACM
13 years 9 months ago
2002
ACM
All existing proposals for querying XML (e.g., XQuery) rely on a pattern-specification language that allows (1) path navigation and branching through the label structure of the XM...
INFORMATICALT
2002
13 years 9 months ago
2002
This paper is concerned with design, implementation and verification of persistent purely functional data structures which are motivated by the representation of natural numbers us...