Sciweavers

11213 search results - page 5 / 2243
» Low-contention data structures
Sort
View
SIAMCOMP
1998
141views more  SIAMCOMP 1998»
13 years 9 months ago
Randomized Data Structures for the Dynamic Closest-Pair Problem
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 ...
Mordecai J. Golin, Rajeev Raman, Christian Schwarz...
PVLDB
2010
114views more  PVLDB 2010»
13 years 8 months ago
ObjectRunner: Lightweight, Targeted Extraction and Querying of Structured Web Data
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...
Talel Abdessalem, Bogdan Cautis, Nora Derouiche
TOIS
2002
97views more  TOIS 2002»
13 years 9 months ago
Burst tries: a fast, efficient data structure for string keys
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...
Steffen Heinz, Justin Zobel, Hugh E. Williams
VLDB
2002
ACM
106views Database» more  VLDB 2002»
13 years 9 months ago
Structure and Value Synopses for XML Data Graphs
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...
Neoklis Polyzotis, Minos N. Garofalakis
NAR
2011
214views Computer Vision» more  NAR 2011»
13 years 19 days ago
IEDB-3D: structural data within the immune epitope database
IEDB-3D is the 3D structural component of the Immune Epitope Database (IEDB) available via the ‘Browse by 3D Structure’ page at http://www.iedb .org. IEDB-3D catalogs B- and T...
Julia V. Ponomarenko, Nikitas Papangelopoulos, Dir...