Access the full text.
Sign up today, get DeepDyve free for 14 days.
A. Policy (2002)
Review of the 2002 Department of Health and Human Service Notice of Proposed Rule Making for The Health Insurance Portability and Accountability Act of 1996 (HIPAA) Privacy Regulations
Eu-Jin Goh, H. Shacham, N. Modadugu, D. Boneh (2003)
SiRiUS: Securing Remote Untrusted Storage
M. Fontoura, E. Shekita, Jason Zien, S. Rajagopalan, Andreas Neumann (2004)
High Performance Index Build Algorithms for Intranet Search Engines
Bruno Becker, S. Gschwind, T. Ohler, B. Seeger, P. Widmayer (1996)
An asymptotically optimal multiversion B-treeThe VLDB Journal, 5
A. Tomasic, H. Garcia-Molina, Kurt Shoens (1994)
Incremental updates of inverted lists for text document retrieval
(2004)
Available at http://www-1.ibm.com/servers/storage/disk/dr
I. Witten, Alistair Moffat, T. Bell (1999)
Managing Gigabytes: Compressing and Indexing Documents and Images
N. Lester, J. Zobel, H. Williams (2004)
In-Place versus Re-Build versus Re-Merge: Index Maintenance Strategies for Text Retrieval Systems
(2002)
Available at http://thomas.loc.gov. 6. P. Crescenzi and V. Kann. A com- pendium of NP optimization problems
D. Cutting, Jan Pedersen (1989)
Optimization for dynamic inverted index maintenance
(2006)
MAKING B-TREES WORK FOR B*
H. Garcia-Molina, J. Ullman, J. Widom (2001)
Database Systems: The Complete Book
S. Heinz, J. Zobel (2003)
Efficient single-pass index construction for text databasesJ. Assoc. Inf. Sci. Technol., 54
E. Appleton (1993)
American Management Systems Inc.Datamation archive, 39
Kaouther Sinaoui, A. Gabillon (2005)
CHRONOS: an authenticated dictionary based on skip lists for timestamping systems
(2003)
EMC Centera Content Addressed Storage System
M.T. Goodrich, R. Tamassia, A. Schwerin (2001)
Implementation of an authenticated dictionary with skip lists and commutative hashingProceedings DARPA Information Survivability Conference and Exposition II. DISCEX'01, 2
E. Brown, Jamie Callan, W. Croft (1994)
Fast Incremental Indexing for Full-Text Information Retrieval
Hakan Hacıgümüş, S. Mehrotra, B. Iyer (2002)
Providing database as a serviceProceedings 18th International Conference on Data Engineering
S. Robertson, S. Walker, M. Hancock-Beaulieu, Aarron Gull, Marianna Lau (1992)
Okapi at TREC
Jun Hirai, S. Raghavan, H. Garcia-Molina, A. Paepcke (2000)
WebBase: a repository of Web pagesComput. Networks, 33
E. Brown, Jamie Callan, W. Croft, J. Moss (1994)
Supporting Full-Text Information Retrieval with a Persistent Object Store
Bryan Klimt, Yiming Yang (2004)
Introducing the Enron Corpus
C. Faloutsos (1985)
Access methods for textACM Comput. Surv., 17
B. Becker, S. Gschwind, T. Ohler, B. Seeger, P. Widmayer (1996)
An asymptotically optimal multiversion B-treeVery Large Data Bases J., 5
M. Easton (1986)
Key-Sequence Data Sets on Inedible StorageIBM J. Res. Dev., 30
(2006)
Content immutable storage for trustworthy record keeping
Peter Rathmann (1984)
Dynamic data structures on optical disks1984 IEEE First International Conference on Data Engineering
J.W.H. Garcia-Molina, J.D. Ullman (2000)
Database Systems, A Complete Book
Qingbo Zhu, W. Hsu (2005)
Fossilized index: the linchpin of trustworthy non-alterable electronic records
Ethan Miller, Darrell Long, W. Freeman, Benjamin Reed (2002)
Strong Security for Network-Attached Storage
C. Faloutsos, H. Jagadish (1992)
On B-Tree Indices for Skewed Distributions
Y. Chao, G. Zipf (1950)
Human Behavior and the Principle of Least Effort: An Introduction to Human EcologyLanguage, 26
Intense regulatory focus on secure retention of electronic records has led to a need to ensure that records are trustworthy, i.e., able to provide irrefutable proof and accurate details of past events. In this paper, we analyze the requirements for a trustworthy index to support keyword-based search queries. We argue that trustworthy index entries must be durable—the index must be updated when new documents arrive, and not periodically deleted and rebuilt. To this end, we propose a scheme for efficiently updating an inverted index, based on judicious merging of the posting lists of terms. Through extensive simulations and experiments with two real world data sets and workloads, we demonstrate that the scheme achieves online update speed while maintaining good query performance. We also present and evaluate jump indexes , a novel trustworthy and efficient index for join operations on posting lists for multi-keyword queries. Jump indexes support insert, lookup and range queries in time logarithmic in the number of indexed documents.
The VLDB Journal – Springer Journals
Published: Mar 1, 2008
Access the full text.
Sign up today, get DeepDyve free for 14 days.