Dynamic access control for relational views
Information Systems
Computer
Analysis of object oriented spatial access methods
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Direct spatial search on pictorial databases using packed R-trees
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
View indexing in relational databases
ACM Transactions on Database Systems (TODS)
System R: relational approach to database management
ACM Transactions on Database Systems (TODS)
The design and implementation of INGRES
ACM Transactions on Database Systems (TODS)
Implementation of integrity constraints and views by query modification
SIGMOD '75 Proceedings of the 1975 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Semantic query optimization in deductive databases. (volumes i and ii) (integrity constraints, intelligent processing, logic)
Interoperability of multiple autonomous databases
ACM Computing Surveys (CSUR) - Special issue on heterogeneous databases
An Architecture for High Performance Engineering Information Systems
IEEE Transactions on Software Engineering
An incremental access method for ViewCache: concept, algorithms, and cost analysis
ACM Transactions on Database Systems (TODS)
Using Ada for rapid prototyping of database applications
WADAS '91 Proceedings of the eighth annual Washington Ada symposium & summer SIGAda meeting on Ada: software: foundation for competitveness
Using differential techniques to efficiently support transaction time
The VLDB Journal — The International Journal on Very Large Data Bases
An Efficient Pictorial Database System for PSQL
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
This paper presents ADMS, a high performance Relational Database Management System that supports intelligent cache techniques for access paths in the database. ADMS improves the database access performance by building an integrated memory of search paths and short-cuts. This is based on a new concept of incremental learning that allows the system to acquire knowledge about access obtained from previous search. Benchmark results comparing the speeds of conventional DBMSs with ADMS are included.