Sciweavers

110 search results - page 16 / 22
» A persistent union-find data structure
Sort
View
ICDE
2001
IEEE
129views Database» more  ICDE 2001»
14 years 8 months ago
High-Performance, Space-Efficient, Automated Object Locking
The paper studies the impact of several lock manager designs on the overhead imposed to a persistent programming language by automated object locking. Our study reveals that a loc...
Grzegorz Czajkowski, Laurent Daynès
ESORICS
2009
Springer
14 years 8 months ago
Authentic Time-Stamps for Archival Storage
Abstract. We study the problem of authenticating the content and creation time of documents generated by an organization and retained in archival storage. Recent regulations (e.g.,...
Alina Oprea, Kevin D. Bowers
XIMEP
2005
ACM
174views Database» more  XIMEP 2005»
14 years 27 days ago
NaXDB - Realizing Pipelined XQuery Processing in a Native XML Database System
Supporting queries and modifications on XML documents is a challenging task, and several related approaches exist. When implementing query and modification languages efficientl...
Jens Hündling, Jan Sievers, Mathias Weske
CIKM
2008
Springer
13 years 9 months ago
A new method for indexing genomes using on-disk suffix trees
We propose a new method to build persistent suffix trees for indexing the genomic data. Our algorithm DiGeST (Disk-Based Genomic Suffix Tree) improves significantly over previous ...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...
COMPGEOM
2009
ACM
14 years 1 months ago
Cache-oblivious range reporting with optimal queries requires superlinear space
We consider a number of range reporting problems in two and three dimensions and prove lower bounds on the amount of space used by any cache-oblivious data structure for these pro...
Peyman Afshani, Chris H. Hamilton, Norbert Zeh