Sciweavers

4541 search results - page 70 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
98
Voted
XSYM
2009
Springer
139views Database» more  XSYM 2009»
15 years 5 months ago
A Data Parallel Algorithm for XML DOM Parsing
Abstract. The extensible markup language XML has become the de facto standard for information representation and interchange on the Internet. XML parsing is a core operation perfor...
Bhavik Shah, Praveen Rao, Bongki Moon, Mohan Rajag...
MICRO
2009
IEEE
326views Hardware» more  MICRO 2009»
15 years 5 months ago
DDT: design and evaluation of a dynamic program analysis for optimizing data structure usage
Data structures define how values being computed are stored and accessed within programs. By recognizing what data structures are being used in an application, tools can make app...
Changhee Jung, Nathan Clark
FOCS
2000
IEEE
15 years 3 months ago
Opportunistic Data Structures with Applications
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
Paolo Ferragina, Giovanni Manzini
ACMMSP
2005
ACM
101views Hardware» more  ACMMSP 2005»
15 years 4 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
SIGMOD
1996
ACM
84views Database» more  SIGMOD 1996»
15 years 3 months ago
Change Detection in Hierarchically Structured Information
Detecting and representing changes to data is important for active databases, data warehousing, view maintenance, and version and configuration management. Most previous work in c...
Sudarshan S. Chawathe, Anand Rajaraman, Hector Gar...