Tree queries: a simple class of relational queries
ACM Transactions on Database Systems (TODS)
Using Semi-Joins to Solve Relational Queries
Journal of the ACM (JACM)
On the Desirability of Acyclic Database Schemes
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
GYO reductions, canonical connections, tree and cyclic schemas and tree projections
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Connections in acyclic hypergraphs: extended abstract
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
The tree property is fundamental for query processing
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Transforming cyclic schemas into trees
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
The complexity of facets (and some facets of complexity)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Properties of acyclic database schemes
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Generating editing environments based on relations and attributes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficiently updating materialized views
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Analysis of a Virtual Memory Model for Maintaining Database Views
IEEE Transactions on Software Engineering
A categorized bibliography on incremental computation
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Maintaining views incrementally
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
View maintenance in a warehousing environment
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Incremental maintenance of views with duplicates
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Efficient maintenance of materialized mediated views
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Query caching and optimization in distributed mediator systems
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Algorithms for deferred view maintenance
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Maintenance of data cubes and summary tables in a warehouse
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Supporting multiple view maintenance policies
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Efficient view maintenance at data warehouses
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Consistency Algorithms for Multi-Source Warehouse View Maintenance
Distributed and Parallel Databases - Special issue on parallel and distributed information systems
On certificates and lookahead in dynamic graph problems
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the eleventh international conference on Information and knowledge management
Affinity-based management of main memory database clusters
ACM Transactions on Internet Technology (TOIT)
Updating Distributed Materialized Views
IEEE Transactions on Knowledge and Data Engineering
Optimization of Materialization Strategies for Derived Data Elements
IEEE Transactions on Knowledge and Data Engineering
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Global View Maintenance by Using Inference Relationship among Views
WAIM '00 Proceedings of the First International Conference on Web-Age Information Management
Query Optimization by Stored Queries
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Deriving Production Rules for Incremental View Maintenance
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
COMPSAC '97 Proceedings of the 21st International Computer Software and Applications Conference
Relations and attributes: A symbiotic basis for editing environments
SLIPE '85 Proceedings of the ACM SIGPLAN 85 symposium on Language issues in programming environments
K2/Kleisli and GUS: experiments in integrated access to genomic data sources
IBM Systems Journal - Deep computing for the life sciences
Scheduling Queries to Improve the Freshness of a Website
World Wide Web
Incremental maintenance of shortest distance and transitive closure in first-order logic and SQL
ACM Transactions on Database Systems (TODS)
K-relevance: a spectrum of relevance for data sources impacting a query
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Understanding the implications of view update policies
VLDB '85 Proceedings of the 11th international conference on Very Large Data Bases - Volume 11
View invalidation for dynamic content caching in multitiered architectures
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Improving parallelism of federated query processing
Data & Knowledge Engineering
Incremental query evaluation in a ring of databases
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Online, non-blocking relational schema changes
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Non-blocking materialized view creation and transformation of schemas
ADBIS'06 Proceedings of the 10th East European conference on Advances in Databases and Information Systems
Hi-index | 0.00 |
In relational databases a view definition is a query against the database, and a view materialization is the result of applying the view definition to the current database A view materialization over a database may change as relations in the database undergo modificationsIn this paper a mechanism is proposed in which the view is materialized at all times The problem which this mechanism addresses is how to quickly update the view in response to database changes A structure is maintained which provides information useful in minimizing the amount of work caused by updatesMethods are presented for handling both general databases and the much simpler tree databases (also called acyclic database) In both cases adding or deleting a tuple can be performed in polynomial time For tree databases the degree of the polynomial is independent of the schema structure while for cyclic databases the degree depends on the schema structure The cost of a sequence of tuple additions (deletions) is also analyzed