Sciweavers

4541 search results - page 29 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
ICDE
2003
IEEE
155views Database» more  ICDE 2003»
14 years 9 months ago
XR-Tree: Indexing XML Data for Efficient Structural Joins
XML documents are typically queried with a combination of value search and structure search. While querying by values can leverage traditional database technologies, evaluating st...
Haifeng Jiang, Hongjun Lu, Wei Wang 0011, Beng Chi...
FLAIRS
2000
13 years 9 months ago
Discovering Structural Patterns in Telecommunications Data
With the increasing amount and complexity of data being collected, there is an urgent need to create automated techniques for mining the data. In particular, data being generated ...
Andi Baritchi, Diane J. Cook, Lawrence B. Holder
ACSC
2001
IEEE
14 years 4 days ago
Efficiency of Data Structures for Detecting Overlaps in Digital Documents
This paper analyses the efficiency of different data structures for detecting overlap in digital documents. Most existing approaches use some hash function to reduce the space req...
Krisztián Monostori, Arkady B. Zaslavsky, H...
WADS
2001
Springer
106views Algorithms» more  WADS 2001»
14 years 28 days ago
Succinct Dynamic Data Structures
Abstract. We develop succinct data structures to represent (i) a sequence of values to support partial sum and select queries and update (changing values) and (ii) a dynamic array ...
Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
PPAM
2007
Springer
14 years 2 months ago
The Relevance of New Data Structure Approaches for Dense Linear Algebra in the New Multi-Core / Many Core Environments
For about ten years now, Bo K˚agstr¨om’s Group in Umea, Sweden, Jerzy Wa´sniewski’s Team at Danish Technical University in Lyngby, Denmark, and I at IBM Research in Yorktown...
Fred G. Gustavson