Sciweavers

63 search results - page 6 / 13
» Transparent pointer compression for linked data structures
Sort
View
VLDB
1993
ACM
138views Database» more  VLDB 1993»
15 years 1 months ago
Searching Large Lexicons for Partially Specified Terms using Compressed Inverted Files
There are many advantages to be gained by storing the lexicon of a full text database in main memory. In this paper we describe how to use a compressed inverted file index to sear...
Justin Zobel, Alistair Moffat, Ron Sacks-Davis
83
Voted
ISEMANTICS
2010
14 years 11 months ago
Linking open government data: what journalists wish they had known
Many government organizations publish a variety of data on the web to facilitate transparency. The multitude of sources has resulted in heterogeneous structures and formats as wel...
Christoph Böhm, Felix Naumann, Markus Freitag...
IEEEPACT
2009
IEEE
14 years 7 months ago
Region Based Structure Layout Optimization by Selective Data Copying
As the gap between processor and memory continues to grow, memory performance becomes a key performance bottleneck for many applications. Compilers therefore increasingly seek to m...
Sandya S. Mannarswamy, Ramaswamy Govindarajan, Ris...
77
Voted
ISCAPDCS
2003
14 years 11 months ago
Parallel Relative Debugging with Dynamic Data Structures
This paper discusses the use of “relative debugging” as a technique for locating errors in a program that has been ported or developed using evolutionary software engineering ...
David Abramson, Raphael A. Finkel, Donny Kurniawan...
82
Voted
MICRO
1997
IEEE
82views Hardware» more  MICRO 1997»
15 years 1 months ago
Procedure Based Program Compression
Cost and power consumption are two of the most important design factors for many embedded systems, particularly consumer devices. Products such as Personal Digital Assistants, pag...
Darko Kirovski, Johnson Kin, William H. Mangione-S...