Sciweavers

11214 search results - page 128 / 2243
» Just-in-time data structures
Sort
View
PPSC
2001
13 years 11 months ago
A Mathematical Cache Miss Analysis for Pointer Data Structures
As the gap between processor and memory performance widens, careful analyses and optimizations of cache memory behavior become increasingly important. While analysis of regular lo...
Hongli Zhang, Margaret Martonosi
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
13 years 11 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...
ICDE
2010
IEEE
199views Database» more  ICDE 2010»
14 years 10 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»
14 years 3 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
14 years 3 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...