ACM Transactions on Database Systems
SCOPUS (1976-2023)SCIE-ISI
1557-4644
0362-5915
Mỹ
Cơ quản chủ quản: ASSOC COMPUTING MACHINERY , Association for Computing Machinery (ACM)
Lĩnh vực:
Information Systems
Các bài báo tiêu biểu
The entity-relationship model—toward a unified view of dataA data model, called the entity-relationship model, is proposed. This model incorporates some of the important semantic information about the real world. A special diagrammatic technique is introduced as a tool for database design. An example of database design and description using the model and the diagrammatic technique is given. Some implications for data integrity, information retriev... ...
Tập 1 Số 1 - Trang 9-36 - 1976
The Grid File
Traditional file structures that provide multikey access to records, for example, inverted files, are extensions of file structures originally designed for single-key access. They manifest various deficiencies in particular for multikey access to highly dynamic files. We study the dynamic aspects of file structures that treat all keys symmetrically, that is, file structures wh... ...
Tập 9 Số 1 - Trang 38-71 - 1984
The functional data model and the data languages DAPLEXDAPLEX is a database language which incorporates:
This paper presents and motivates the DAPLEX language and the underlying data model on which it is based.
Tập 6 Số 1 - Trang 140-173 - 1981
A foundation for representing and querying moving objects
Spatio-temporal databases deal with geometries changing over time. The goal of our work is to provide a DBMS data model and query language capable of handling such time-dependent geometries, including those changing continuously that describe
moving objects
. Two fundamental abstractions are
moving poi... ...
Tập 25 Số 1 - Trang 1-42 - 2000
Preference formulas in relational queries
The handling of user preferences is becoming an increasingly important issue in present-day information systems. Among others, preferences are used for
information filtering and extraction
to reduce the volume of data presented to the user. They are also used to keep track of
user profiles...
Tập 28 Số 4 - Trang 427-466 - 2003
Join indicesIn new application areas of relational database systems, such as artificial intelligence, the join operator is used more extensively than in conventional applications. In this paper, we propose a simple data structure, called a join index, for improving the performance of joins in the context of complex queries. For most of the joins, updates to join indices incur very little overhead. Som... ...
Tập 12 Số 2 - Trang 218-246 - 1987
Query processing in a system for distributed databases (SDD-1)
This paper describes the techniques used to optimize relational queries in the SDD-1 distributed database system. Queries are submitted to SDD-1 in a high-level procedural language called Datalanguage. Optimization begins by translating each Datalanguage query into a relational calculus form called an
envelope
, which is essen... ...
Tập 6 Số 4 - Trang 602-625 - 1981
A linear-time probabilistic counting algorithm for database applications
We present a probabilistic algorithm for counting the number of unique values in the presence of duplicates. This algorithm has
O
(
q
) time complexity, where
q
is the number of values including duplicates, and produces an est... ...
Tập 15 Số 2 - Trang 208-229 - 1990
On optimizing an SQL-like nested querySQL is a high-level nonprocedural data language which has received wide recognition in relational databases. One of the most interesting features of SQL is the nesting of query blocks to an arbitrary depth. An SQL-like query nested to an arbitrary depth is shown to be composed of five basic types of nesting. Four of them have not been well understood and more work needs to be done to impro... ...
Tập 7 Số 3 - Trang 443-469 - 1982
Decomposition—a strategy for query processingStrategy for processing multivariable queries in the database management system INGRES is considered. The general procedure is to decompose the query into a sequence of one-variable queries by alternating between (a) reduction: breaking off components of the query which are joined to it by a single variable, and (b) tuple substitution: substituting for one of the variables a tuple at a tim... ...
Tập 1 Số 3 - Trang 223-241 - 1976