Sciweavers

3932 search results - page 159 / 787
» Adaptive Index Structures
Sort
View
153
Voted
POPL
2012
ACM
13 years 11 months ago
Programming with binders and indexed data-types
We show how to combine a general purpose type system for an existing language with support for programming with binders and contexts by refining the type system of ML with a rest...
Andrew Cave, Brigitte Pientka
146
Voted
WWW
2006
ACM
16 years 4 months ago
Compressing and searching XML data via two zips
XML is fast becoming the standard format to store, exchange and publish over the web, and is getting embedded in applications. Two challenges in handling XML are its size (the XML...
Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini...
105
Voted
ICMCS
2000
IEEE
103views Multimedia» more  ICMCS 2000»
15 years 8 months ago
Activity-Adaptive Modeling of Dynamic Multimedia Traffic
Most of the existing work on modeling variable bit rate (VBR) video sources does not either explicitly take into account groupof-pictures (GOP) or assumes a fixed GOP structure. R...
Deepak S. Turaga, Tsuhan Chen
127
Voted
ICDE
1998
IEEE
124views Database» more  ICDE 1998»
15 years 7 months ago
Compressing Relations and Indexes
We propose a new compression algorithm that is tailored to database applications. It can be applied to a collection of records, and is especially e ective for records with many lo...
Jonathan Goldstein, Raghu Ramakrishnan, Uri Shaft
ICDE
2007
IEEE
190views Database» more  ICDE 2007»
15 years 7 months ago
CPS-tree: A Compact Partitioned Suffix Tree for Disk-based Indexing on Large Genome Sequences
Suffix tree is an important data structure for indexing a long sequence (like a genome sequence) or a concatenation of sequences. It finds many applications in practice, especiall...
Swee-Seong Wong, Wing-Kin Sung, Limsoon Wong