vldb_1994_elementary.txt

利用lwp：：get写的

achieved by using suitable techniques. In this paper, we propose a
simple approach to global clustering called cluster organization. We
will demonstrate that this cluster organization leads to considerable
performance improvements without any algorithmic overhead. Based on
real geographic data, we perform a detailed empirical performance
evaluation and compare the cluster organization to other organization
models not using global clustering. We will show that global clustering
speeds up the processing of window queries as well as spatial joins
without decreasing the performance of the insertion of new objects and
of selective queries such as point queries. The spatial join is sped up
by a factor of about 4, whereas non-selective window queries are
accelerated by even higher speed up factors.</abstract></paper><paper><title>Indexing Multiple Sets.</title><author><AuthorName>Christoph Kilger</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Guido Moerkotte</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>1994</year><conference>International Conference on Very Large Data Bases</conference><citation><name>Organization and Maintenance of Large Ordered Indices.</name><name>Object and File Management in the EXODUS Extensible Database System.</name><name>A General Framework for the Optimization of Object-Oriented Queries.</name><name>Implementing a Generalized Access Path Structure for a Relational Database System.</name><name>Object-Oriented Database Management: Applications in Engineering and Computer Science.</name><name>Efficient Access Methods in Deductive and Object-Oriented Databases.</name><name>H-trees: A Dynamic Associative Search Index for OODB.</name><name>The Grid File: An Adaptable, Symmetric Multikey File Structure.</name><name>The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems.</name><name>Join Indices.</name></citation><abstract>We examine the performance of B+-tree
based index structures for
multiple sets, as developed in the context of object bases.  Index
structures for multiple sets can be classified into those that group
entries according to their key value and those that group entries
according to their set membership. The former are particularly suited
for exact match queries on all indexed sets, the latter especially
support range queries on a small number of all indexed sets. The goal
is to thoroughly evaluate the performance of both grouping strategies.

There exist two good reasons for adding a new index structure to the
evaluation:

The performance potentials of set grouping index structures are
not yet fully exploited.
Up to now, the database administrator has to choose between the
key grouping and the set grouping index structures. If the application
profile consists of both, exact match queries and range queries, this 
is not really a choice. Hence, a more flexible index structure is
needed which can be tuned to a given mix containing both, exact
match and range queries.

These two reasons led us to the development of the CG-tree. The focus
of the paper is on introducing the CG-tree and on a thorough analysis
of the performance of the CH-index, H-tree, and CG-tree under various
conditions.</abstract></paper><paper><title>Fast Incremental Indexing for Full-Text Information Retrieval.</title><author><AuthorName>Eric W. Brown</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>James P. Callan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>W. Bruce Croft</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>1994</year><conference>International Conference on Very Large Data Bases</conference><citation><name>Supporting Full-Text Information Retrieval with a Persistent Object Store.</name><name>The INQUERY Retrieval System.</name><name>Optimizations for Dynamic Inverted Index Maintenance.</name><name>Access Methods for Text.</name><name>Hybrid Index Organizations for Text Databases.</name><name>On B-Tree Indices for Skewed Distributions.</name><name>Design of the  Mneme Persistent Object Store.</name><name>Introduction to Modern Information Retrieval.
 McGraw-Hill Book Company 1984, ISBN 0-07-054484-0</name><name>Synthetic Workload Performance Analysis of Incremental Updates.</name><name>Evaluation of an Inference Network-Based Retrieval Model.</name><name>A Comparison of Text Retrieval Models.</name><name>Incremental Updates of Inverted Lists for Text Document Retrieval.</name><name>Implementations of Partial Document Ranking Using Inverted Files.</name><name>Managing Gigabytes: Compressing and Indexing Documents and Images.
 Van Nostrand Reinhold 1994, ISBN 0-442-01863-0</name><name>Applying Informetric Characteristics of Databases to IR System File Design, Part I: Informetric Models.</name><name>Applying Informetric Characteristics of Databases to IR System File Design, Part II: Simulation Comparisons.</name><name>Human Behaviour and the Principle of Least Effort: an Introduction to Human Ecology.
 Addison-Wesley 1949</name><name>An Efficient Indexing Technique for Full Text Databases.</name></citation><abstract>Full-text information retrieval systems have traditionally been
designed for archival environments.  They often provide little or no
support for adding new documents to an existing document collection,
requiring instead that the entire collection be re-indexed.  Modern
applications, such as information filtering, operate in dynamic
environments that require frequent additions to document collections.
We provide this ability using a traditional inverted file index built
on top of a persistent object store.  The data management facilities of
the persistent object store are used to produce efficient incremental
update of the inverted lists.  We describe our system and present
experimental results showing superior incremental indexing and
competitive query processing performance.</abstract></paper><paper><title>The hcC-tree: An Efficient Index Structure for Object Oriented Databases.</title><author><AuthorName>B. Sreenath</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>S. Seshadri</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>1994</year><conference>International Conference on Very Large Data Bases</conference><citation><name>Indexing Techniques for Queries on Nested Objects.</name><name>The Ubiquitous B-Tree.</name><name>Evaluation of Signature Files as Set Access Facilities in OODBs.</name><name>Access Support in Object Bases.</name><name>Efficient Access Methods in Deductive and Object-Oriented Databases.</name><name>H-trees: A Dynamic Associative Search Index for OODB.</name></citation><abstract>Object oriented database systems, in contrast to traditional relational
database systems, allow the scope of a query against a class to be
either the class itself or all classes in the class hierarchy rooted at
the class. If object oriented databases have to achieve acceptable
performance levels against such queries, we need indexes that support
efficient retrieval of instances from a single class as well as from
all the classes in a class hierarchy. In this paper, we propose a new
index structure called hcC-tree (hierarchy class Chain tree) that
supports both kinds of retrieval efficiently.  Moreover, the update
cost of the index structure is bounded by the height of the hcC-tree
(which is usually never more than four). We have implemented hcC-trees
along with H-trees and CH-trees (two other index structures that have
been proposed in the literature) and report a detailed performance
analysis of the three structures. The performance study reveals that
hcC-trees perform much better than the other two structures under most
circumstances.  The balanced behaviour of hcC-tree under all kinds of
queries and in the presence of updates shows that it is a promising
index structure for the future.</abstract></paper><paper><title>A Transaction Replication Scheme for a Replicated Database with Node Autonomy.</title><author><AuthorName>Ada Wai-Chee Fu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>David Wai-Lok Cheung</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>1994</year><conference>International Conference on Very Large Data Bases</conference><citation><name>Concurrency Control in Distributed Database Systems.</name><name>Concurrency Control and Recovery in Database Systems.
 Addison-Wesley 1987, ISBN 0-201-10715-5</name><name>Site Optimal Termination Protocols for a Distributed Database under Network Partitioning.</name><name>Achieving Robustness in Distributed Database Systems.</name><name>Availability in Partitioned Replicated Databases.</name><name>Maintaining Availability in Partitioned Replicated Databases.</name><name>Node Autonomy in Distributed Systems.</name><name>Weighted Voting for Replicated Data.</name><name>Update Propagation in Bakunin Data Networks.</name><name>Time, Clocks, and the Ordering of Events in a Distributed System.</name><name>Practical Uses of Synchronized Clocks in Distributed Systems.</name><name>Reliable Scheduling in a TMR Database System.</name><name>A Fault-Tolerant Commit Protocol for Replicated Databases.</name><name>Nonblocking Commit Protocols.</name><name></name></citation><abstract>Many proposed protocols for replicated databases consider centralized
control of each transaction so that given a transaction, some site will
monitor the remote data access and transaction commit. We consider the