vldb_1999_elementary.txt

利用lwp：：get写的

be interesting. We wish to identify data points that are
somehow anomalous or ``surprising''.
We formally define the notion of a deviant in a time
series, based on a representation sparsity metric.
We develop an efficient algorithm to identify devinats
is a time series. We demonstrate how this technique can
be used to locate interesting artifacts in time series
data, and present experimental evidence of the value
of our technique.
As a side benefit, our algorithm are able to produce
histogram representations of data, that
have substantially lower error than ``optimal histograms''
for the same total storage, including both
histogram buckets and the deviants stored separately.
This is of independent interest for selectivity estimation.</abstract></paper><paper><title>Exploiting Versions for Handling Updates in Broadcast Disks.</title><author><AuthorName>Evaggelia Pitoura</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Panos K. Chrysanthis</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>1999</year><conference>International Conference on Very Large Data Bases</conference><citation><name>Broadcast Disks: Data Management for Asymmetric Communications Environments.</name><name>Disseminating Updates on Broadcast Disks.</name><name>The Design of Teletext Broadcast Cycles.</name><name>Certification Reports: Supporting Transactions in Wireless Systems.</name><name>Sleepers and Workaholics: Caching Strategies in Mobile Environments.</name><name>A Critique of ANSI SQL Isolation Levels.</name><name>Concurrency Control and Recovery in Database Systems.
 Addison-Wesley 1987, ISBN 0-201-10715-5</name><name>Server-Initated Document Dissemination for the WWW.</name><name>The Datacycle Architecture.</name><name>Adaptive Broadcast Protocols to Support Power Conservant Retrieval by Mobile Users.</name><name>A Framework for Scalbale Dissemination-Based Systems.</name><name>Polychannel Systems for Mass Digital Communications.</name><name>Maintenance of Materialized Views: Problems, Techniques, and Applications.</name><name>Data on Air: Organization and Access.</name><name>Bit-Sequences: An Adaptive Cache Invalidation Method in Mobile Client/Server Environments.</name><name>Efficient and Flexible Methods for Transient Versioning of Records to Avoid Locking by Read-Only Transactions.</name><name>Scalable Processing of Read-Only Transactions in Broadcast Push.</name><name>On-Line Warehouse View Maintenance.</name><name>On Correctness of Non-serializable Executions.</name><name>Efficient Concurrency Control for Broadcast Environments.</name><name>SIFT - a Tool for Wide-Area Information Dissemination.</name><name>View Maintenance in a Warehousing Environment.</name></citation><abstract>Recently, broadcasting has attracted considerable
attention as a means of disseminating
information to large client populations in both
wired and wireless settings. In this paper, we
exploit versions to increase the concurrency
of client transactions in the presentce of updates.
We consider three alternative mediums for storing versions:
(a) the air: older versions are broadcast along with current data,
(b) the client's local cache: older versions are maintained in the 
cache, and
(c) a local database or warehouse at the client: part of the server's
database is maintained at the client in form of a multiversion
materialized view.
The proposed techniques are scalable in that they
provide consistency without any direct communication
from clients to the server. Performance results show that the
overhead of maintaining versions can be kept low, while providing
a considerable increase in concurrency.</abstract></paper><paper><title>Fast Algorithms for Maintaining Replica Consistency in Lazy Master Replicated Databases.</title><author><AuthorName>Esther Pacitti</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Pascale Minet</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Eric Simon</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>1999</year><conference>International Conference on Very Large Data Bases</conference><citation><name>Partitioned Data Objects in Distributed Databases.</name><name>Exploiting Atomic Broadcast in Replicated Databases (Extended Abstract).</name><name>Data Caching Issues in an Information Retrieval System.</name><name>Principles of Transaction Processing for Systems Professionals.</name><name>An Overview of Data Warehousing and OLAP Technology.</name><name>Deferred Updates and Data Placement in Distributed Databases.</name><name>Managing Semantic Heterogeneity with Production Rules and Persistent Queues.</name><name>The Management of Interdependent Asynchronous Transactions in Heterogeneous Database Environments.</name><name>OSCAR: A System for Weak-Consistency Replication.</name><name>The Dangers of Replication and a Solution.</name><name>A FIFO Worst Case Analysis for a Hard Real-Time Distributed Problem with Consistency Constraints.</name><name>Maintaining Views Incrementally.</name><name>Improving Performance in Replicated Databases through Relaxed Coherency.</name><name>Transaction Processing: Concepts and Techniques.</name><name>Protocols for Integrity Constraint Checking in Federated Databases.</name><name>A Suite of Database Replication Protocols based on Group Communication Primitives.</name><name>Extending Logging for Database Snapshot Refresh.</name><name>Principles of Distributed Database Systems, Second Edition.
 Prentice-Hall 1999</name><name>Improving Data Freshness in Lazy Master Schemes.</name><name>Using Broadcast Primitives in Replicated Databases.</name><name>Using History Information to Process Delayed Database Updates.</name><name>Management of Interdependent Data: Specifying Dependency and Consistency Requirements.</name><name>Managing Update Conflicts in Bayou, a Weakly Connected Replicated Storage System.</name><name>View Maintenance in a Warehousing Environment.</name></citation><abstract>In a lazy master replicated database, a transaction
can commit after updating one replica copy at some
master node.
After the transaction commits,
the updates are propagated towards the other replicas,
which are updated in separate refresh transactions.
A central problem is the design of algorithms that
maintain replica's consistency while minimizing
the performance degeneration due to the synchronization
of refresh transactions.
We propose a simple and general refreshment algorithm that
solves this problem and we prove its correctness.
We then present two main optimizations. One is based on
specific properties of replicas' topology. The other
uses an immediate update propagation strategy.
Our performace evaluation demonstrates the
effectiveness of the optimization.</abstract></paper><paper><title>Active Views for Electronic Commerce.</title><author><AuthorName>Serge Abiteboul</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Bernd Amann</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Sophie Cluet</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Anat Eyal</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Laurent Mignet</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Tova Milo</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>1999</year><conference>International Conference on Very Large Data Bases</conference><citation><name>A Logical View of Structured Files.</name><name>Incremental Maintenance for Materialized Views over Semistructured Data.</name><name>The Lorel Query Language for Semistructured Data.</name><name>Relational Transducers for Electronic Commerce.</name><name>Advanced Transaction Models in Workflow Contexts.</name><name></name><name>Update Semantics of Relational Views.</name><name>Xml-ql: A Query Language for XML.</name><name>Updating Relational Views.</name><name>Updates to Relational Databases Through Views Involving Joins.</name><name>Type Inference for Queries on Semistructured Data.</name><name></name><name></name><name>Semantics and Expressiveness Issues in Active Databases.</name><name></name><name>Virtual Schemas and Bases.</name><name></name><name></name><name></name><name></name><name></name><name></name><name>Active Database Systems: Triggers and Rules For Advanced Database Processing.</name><name>XML Repository and Active Views Demonstration.</name></citation><abstract>Electronic commerce is emerging as a major Web-supported
application. In this paper we argue that database technology
can, and should, provide the backbone for a wide range of
such applications. More precisely, we present here the
Active-Views system, which, relying on an extensive use of
database features including views, active rules (triggers),
and enhanced mechanisms for notification, access control and
logging/tracing of users activities, provides the needed basis
for electronic commerce.
Based on the emerging XML standards (DOM, query languages for XML,
etc.), the system offers a novel declarative view specification
language, describing the relevant data and activities of all actors
(e.g. vendors and clients) participating in electronic commerce
activities. Then, acting as an application generator, the system
generates an actual, possibly customized, Web application that
allows users to perform the given set of controlled activities and
to work interactively on the specified data in a standard
distributed environment.
The ActiveView system is developed at INRIA on top of Java and
ArdentSoftware's XML repository.</abstract></paper><paper><title>An Adaptive Hybrid Server Architecture for Client Caching ODBMSs.</title><author><AuthorName>Kaladhar Voruganti</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>M. Tamer {\"O}zsu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Ronald C. Unrau</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>1999</year><conference>International Conference on Very Large Data Bases</conference><citation><name>Efficient Optimistic Concurrency Control Using Loosely Synchronized Clocks.</name><name>A High Performance Configurable Storage Manager.</name><name>HAC: Hybrid Adaptive Caching for Distributed Storage Systems.</name><name>Shoring Up Persistent Applications.</name><name>The oo7 Benchmark.</name><name>Fine-Grained Sharing in a Page Server OODBMS.</name><name>Semantic Data Caching and Replacement.</name><name>A Study of Three Alternative Workstation-Server Architectures for Object Oriented Database Systems.</name><name>Client-Server Caching Revisited.</name><name>Transactional Client-Server Cache Consistency: Alternatives and Performance.</name><name>Crash Recovery in Client-Server EXODUS.</name><name>The Modified Object Buffer: A Storage Management Technique for Object-Oriented Databases.
Ph.D. thesis,  MIT Laboratory for Computer Science 1995</name><name>A Multi-Threaded Architecture for Prefetching in Object Bases.</name><name>Architecture of the ORION Next-Generation Database System.</name><name>Performance Tradeoffs for Client-Server Query Processing.</name><name>Dual-Buffering Strategies in Object Bases.</name><name>Safe and Efficient Sharing of Persistent Objects in Thor.</name><name>The ObjectStore Database System.</name><name>ARIES/CSA: A Method for Database Recovery in Client-Server Architectures.</name><name></name><name>Hybrid Caching for Large-Scale Object Systems.</name><name>An Asynchronous Avoidance-Based Cache Consistency Algorithm for Client Caching DBMSs.</name><name>Fine-granularity Locking and Client-Based Logging for Distributed Architectures.</name><name>On the Performance of Object Clustering Techniques.</name><name></name><name>QuickStore: A High Performance Mapped Object Store.</name><name>Implementing Crash Recovery in QuickStore: A Performance Study.</name></citation><abstract>Current client-server object database management
systems employ either a page server or an object
server architecture. Both of these architectures
have their respective strengths, but they also have
key drawbacks for important system and workload
configurations. We propose a new hybrid server
architecture which combines the best features of
both page server and object server architectures
while avoiding their problems. The new architecture
incorporates new or adapted versions of
data transfer, recovery, and cache consistency algorithms;
in this paper we focus only on the data transfer and
recovery issues. The data transfer mechanism
allows the hybrid server to dynamically
behave as both page and object server. The
performance comparison of the hybrid server with
object and page servers indicates that the performance of
the hybrid server is more robust than the others.</abstract></paper><paper><title>Dynamic Load Balancing for Parallel Association Rule Mining on Heterogenous PC Cluster Systems.</title><author><AuthorName>Masahisa Tamura</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Masaru Kitsuregawa</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>1999</year><conference>International Conference on Very Large Data Bases</conference><citation><name>Fast Algorithms for Mining Association Rules in Large Databases.</name><name>Parallel Mining of Association Rules.</name><name></name><name>A Fast Distributed Algorithm for Mining Association Rules.</name><name>Predictive Dynamic Load Balancing of Parallel Hash-Joins Over Heterogeneous Processors in the Presence of Data Skew.</name><name>Parallel Database Systems: The Future of High Performance Database Systems.</name><name>Scalable Parallel Data Mining for Association Rules.</name><name>Efficient Parallel and Data Mining for Association Rules.</name><name>Memory Placement Techniques for Parallel Association Mining.</name><name>Hash Based Parallel Algorithms for Mining Association Rules.</name><name>Parallel Mining Algorithms for Generalized Association Rules with Classification Hierarchy.</name><name>Effect of Data Skewness in Parallel Mining of Association Rules.</name><name>New Algorithms for Fast Discovery of Association Rules.</name><name>The Asilomar Report on Database Research.</name></citation><abstract>The dynamic load balancing strategies for parallel
association rule mining are proposed under
heterogeneous PC cluster environment.
PC cluster is recently regarded as one of the
most promising platforms for heavy data intensive
applications, such as decision support
query processing and data mining. The development
period of PC hardware is becoming extremely short,