Sciweavers

11219 search results - page 65 / 2244
» Retroactive data structures
Sort
View
LWA
2008
14 years 11 months ago
Rule-Based Information Extraction for Structured Data Acquisition using TextMarker
Information extraction is concerned with the location of specific items in (unstructured) textual documents, e.g., being applied for the acquisition of structured data. Then, the ...
Martin Atzmüller, Peter Klügl, Frank Pup...
VLDB
2002
ACM
106views Database» more  VLDB 2002»
14 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
ICNP
2007
IEEE
15 years 4 months ago
HEXA: Compact Data Structures for Faster Packet Processing
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
Sailesh Kumar, Jonathan S. Turner, Patrick Crowley...
ACMMSP
2005
ACM
101views Hardware» more  ACMMSP 2005»
15 years 3 months ago
Transparent pointer compression for linked data structures
64-bit address spaces are increasingly important for modern applications, but they come at a price: pointers use twice as much memory, reducing the effective cache capacity and m...
Chris Lattner, Vikram S. Adve
WDAS
2000
14 years 11 months ago
Scalable Distributed Data Structures for High-Performance Databases
Present databases, whether on centralized or parallel DBMSs, do not deal well with scalability. We present an architecture for Wintel multicomputers termed AMOS-SDDS, coupling a h...
Yakham Ndiaye, Aly Wane Diene, Witold Litwin, Tore...