Sciweavers

11214 search results - page 208 / 2243
» Just-in-time data structures
Sort
View
SIGMOD
1996
ACM
84views Database» more  SIGMOD 1996»
14 years 2 months ago
Change Detection in Hierarchically Structured Information
Detecting and representing changes to data is important for active databases, data warehousing, view maintenance, and version and configuration management. Most previous work in c...
Sudarshan S. Chawathe, Anand Rajaraman, Hector Gar...
NAR
2008
90views more  NAR 2008»
13 years 10 months ago
Many Microbe Microarrays Database: uniformly normalized Affymetrix compendia with structured experimental metadata
Many Microbe Microarrays Database (M3D ) is designed to facilitate the analysis and visualization of expression data in compendia compiled from multiple laboratories. M3D contains...
Jeremiah J. Faith, Michael E. Driscoll, Vincent A....
JACM
2000
131views more  JACM 2000»
13 years 10 months ago
The soft heap: an approximate priority queue with optimal error rate
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
Bernard Chazelle
LREC
2010
143views Education» more  LREC 2010»
14 years 7 days ago
A Flexible Representation of Heterogeneous Annotation Data
This paper describes a new flexible representation for the annotation of complex structures of metadata over heterogeneous data collections containing text and other types of medi...
Richard Johansson, Alessandro Moschitti
SPAA
2005
ACM
14 years 4 months ago
Concurrent cache-oblivious b-trees
This paper presents concurrent cache-oblivious (CO) B-trees. We extend the cache-oblivious model to a parallel or distributed setting and present three concurrent CO B-trees. Our ...
Michael A. Bender, Jeremy T. Fineman, Seth Gilbert...