Sciweavers

11212 search results - page 281 / 2243
» Semi-persistent Data Structures
Sort
View
ISCA
1999
IEEE
90views Hardware» more  ISCA 1999»
15 years 11 months ago
Effective Jump-Pointer Prefetching for Linked Data Structures
Current techniques for prefetching linked data structures (LDS) exploit the work available in one loop iteration or recursive call to overlap pointer chasing latency. Jumppointers...
Amir Roth, Gurindar S. Sohi
ICDE
2010
IEEE
199views Database» more  ICDE 2010»
16 years 6 months ago
Fuzzy Matching of Web Queries to Structured Data
Recognizing the alternative ways people use to reference an entity, is important for many Web applications that query structured data. In such applications, there is often a mismat...
Tao Cheng, Hady Wirawan Lauw, Stelios Paparizos
IV
2005
IEEE
98views Visualization» more  IV 2005»
16 years 5 days ago
Exploring Highly Structured Data: A Comparative Study of Stardinates and Parallel Coordinates
Comparing different Information Visualization (InfoVis) techniques is a challenging task and a necessary step to reach the users and their tasks. We evaluated the effectiveness in...
Monika Lanzenberger, Silvia Miksch, Margit Pohl
EDBTW
2004
Springer
15 years 12 months ago
L-Tree: A Dynamic Labeling Structure for Ordered XML Data
With the ever growing use of XML as a data representation format, we see an increasing need for robust, high performance XML database systems. While most of the recent work focuses...
Yi Chen, George A. Mihaila, Rajesh Bordawekar, Sri...
HPCA
2009
IEEE
16 years 7 months ago
Techniques for bandwidth-efficient prefetching of linked data structures in hybrid prefetching systems
Linked data structure (LDS) accesses are critical to the performance of many large scale applications. Techniques have been proposed to prefetch such accesses. Unfortunately, many...
Eiman Ebrahimi, Onur Mutlu, Yale N. Patt