Sciweavers

11213 search results - page 146 / 2243
» Low-contention data structures
Sort
View
IV
2005
IEEE
98views Visualization» more  IV 2005»
15 years 9 months 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 9 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...
FIMI
2004
175views Data Mining» more  FIMI 2004»
15 years 5 months ago
CT-PRO: A Bottom-Up Non Recursive Frequent Itemset Mining Algorithm Using Compressed FP-Tree Data Structure
Frequent itemset mining (FIM) is an essential part of association rules mining. Its application for other data mining tasks has also been recognized. It has been an active researc...
Yudho Giri Sucahyo, Raj P. Gopalan
HPCA
2009
IEEE
16 years 4 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
SIGMOD
2008
ACM
188views Database» more  SIGMOD 2008»
16 years 4 months ago
Just-in-time query retrieval over partially indexed data on structured P2P overlays
Structured peer-to-peer (P2P) overlays have been successfully employed in many applications to locate content. However, they have been less effective in handling massive amounts o...
Sai Wu, Jianzhong Li, Beng Chin Ooi, Kian-Lee Tan