scispace - formally typeset
Search or ask a question

Showing papers on "Spatiotemporal database published in 1989"


Book
01 Jan 1989
TL;DR: Fundamentals of Database Systems combines clear explanations of theory and design, broad coverage of models and real systems, and excellent examples with up-to-date introductions to modern database technologies.
Abstract: From the Publisher: Fundamentals of Database Systems combines clear explanations of theory and design, broad coverage of models and real systems, and excellent examples with up-to-date introductions to modern database technologies. This edition is completely revised and updated, and reflects the latest trends in technological and application development. Professors Elmasri and Navathe focus on the relational model and include coverage of recent object-oriented developments. They also address advanced modeling and system enhancements in the areas of active databases, temporal and spatial databases, and multimedia information systems. This edition also surveys the latest application areas of data warehousing, data mining, web databases, digital libraries, GIS, and genome databases. New to the Third Edition Reorganized material on data modeling to clearly separate entity relationship modeling, extended entity relationship modeling, and object-oriented modeling Expanded coverage of the object-oriented and object/relational approach to data management, including ODMG and SQL3 Uses examples from real database systems including OracleTM and Microsoft AccessAE Includes discussion of decision support applications of data warehousing and data mining, as well as emerging technologies of web databases, multimedia, and mobile databases Covers advanced modeling in the areas of active, temporal, and spatial databases Provides coverage of issues of physical database tuning Discusses current database application areas of GIS, genome, and digital libraries

4,242 citations


Proceedings Article
01 Jul 1989
TL;DR: A rather comprehensive query model is presented which takes into account the semantics of the class hierarchy and nested objects, and is inherently richer than the relational or nested relational model of queries.
Abstract: One major source of confusion, and consequent c&icisms, about object-oriented databases has been the lack of a comprehensive model of queries. Although there is a reasonable degree of agreement about an object-oriented data model, few operational systems support a query model for object-oriented databases. In this paper, we present a rather comprehensive query model which is consistent with object-oriented concepts embodied in the object-oriented data model. The model takes into account the semantics of the class hierarchy and nested objects, and as such is inherently richer than the relational or nested relational model of queries. A significant subset of the model has been cast into a query language which is supported in the ORION object-oriented database system.

242 citations


Book ChapterDOI
TL;DR: In this paper, a new spatial knowledge structure is proposed for pictorial database design, which consists of an image database, symbolic projections representing the spatial relations among objects or sub-objects in an image, and rules to derive complex spatial relations from the generalized 2D string representation of the symbolic projections.
Abstract: We present a methodology for pictorial database design, based upon a new spatial knowledge structure. This spatial knowledge structure consists of an image database, symbolic projections representing the spatial relations among objects or sub-objects in an image, and rules to derive complex spatial relations from the generalized 2D string representation of the symbolic projections. The most innovative aspect of this spatial knowledge structure is the use of symbolic projections to represent pictorial knowledge as generalized 2D strings. Since spatial knowledge is encoded into strings, inference rules can be applied for spatial reasoning. Finally, we describe a prototype knowledge-based pictorial database system, which supports spatial reasoning, flexible pictorial information retrieval, visualization and manipulation.

48 citations


Proceedings ArticleDOI
04 Oct 1989
TL;DR: The IconicBrowser, which allows the user to retrieve objects in a database by means of icons, is described, which generates predicate-based (text-base) queries which can be used in other applications of the database.
Abstract: The IconicBrowser, which allows the user to retrieve objects in a database by means of icons, is described. Icons represent classes and objects in the database. Queries are specified by overlapping one icon over another. The system then interprets them into database operations, depending on their combination. At the same time, the system generates predicate-based (text-base) queries which can be used in other applications of the database. >

47 citations


Journal ArticleDOI
TL;DR: A model and a language for specifying spatial integrity constraints in pictorial databases are presented and the language presented primarily uses pictures to specify constraints.
Abstract: A model and a language for specifying spatial integrity constraints in pictorial databases are presented. Spatial integrity constraints are assertions about the correct behavior of database systems that specify acceptable database states and state transitions. They also serve as restrictions on positions occupied by objects in a picture. The language presented primarily uses pictures to specify constraints. The constraint pictures depict unacceptable database states. A data model provides the basic semantics for picture interpretation. >

35 citations


Journal ArticleDOI
TL;DR: In this paper, an object-based interface between relational databases and expert systems is proposed, where a semantic model of the database structure is exploited to map relations automatically into object templates, where each template can be a complex combination of join and projection operations.

18 citations


Journal ArticleDOI
TL;DR: The paper describes the background to object-oriented databases and outlines the rationale for this approach, and concludes with a possible application, in this case a cartographic database, explaining why the object- oriented approach is more appropriate to this application than traditional database approaches, such as the relational approach.
Abstract: The object-oriented approach is being used in several areas of computing, including programming, databases, computer-aided design, and office information systems. The paper is a tutorial introduction to object-oriented databases, which is a new application in this field, although object-oriented programming has been under development since the late 1960s. The paper describes the background to object-oriented databases and outlines the rationale for this approach. It concludes with a possible application, in this case a cartographic database, explaining why the object-oriented approach is more appropriate to this application than traditional database approaches, such as the relational approach.

14 citations


Proceedings Article
01 Jul 1989
TL;DR: The classical relational model is extended so that a transaction, i.e., an update or a query is recorded in such a way that its effect can be determine at any time in the future; thus, the model is a zero information-loss model logical structure.
Abstract: The research in temporal databases has, so far, concentrated on the history of an object as it exists in the real world. Instead, in this paper we view the history of an object as it is recorded in a database. Such a history is obtained by extr (insert, modify, and Yr lating the outcome of the u$ttes elete) made to the object at drscrete instants. Our model su ports two kinds of query-users: the s stem-user, and the coszical-user. For the classical-user, E P t e interface to the database is identical to the usual interface in classical snapshot databases. We extend the classical relational model so that a transaction, i.e., an update or a (retrieval) query is recorded in such a way that its effect can be determine d at any time in the future; thus, our model is a zero information-loss model logical structure im P I Theorem 1). The oeed upon the mode allows us to give a powerful algebra or the system-user to query the circumstantial information surrounding updates and queries. In addition, a single execution of a query can be identified with the relation it retrieves; thus, a user can query queries, query queries on queries, ad infinitum. The model represents an application of temporal databases to mainstream databases. It can be used in auditing, and as a foundation for building secure systems.

13 citations



01 Jan 1989
TL;DR: An insulating or semiconductive tube defines a path along which powder flows from a source to an article to be coated therewith.
Abstract: An insulating or semiconductive tube defines a path along which powder flows from a source to an article to be coated therewith. Electrodes that extend circumferentially and are equispaced axially are embedded in the tube wall and are so connected with terminals of an a.c. source that there is a constantly varying potential difference between axially adjacent electrodes, to produce a field that tends to repel powder from the tube wall. A corona discharge electrode, fixed at the outlet end of the tube, is connected with one terminal of a high tension d.c. source. The other d.c. terminal is grounded to the article to be coated.

10 citations


Book ChapterDOI
TL;DR: A general model of a large archival store is presented, and the properties of a generalized Morton key as a means of indexing tiles are analyzed, and its role in traditional systems of tile indexing is illustrated.
Abstract: Geographical variation is infinitely complex, so the information coded in a spatial database can only approximate reality. The information will always be inadequate, in spatial resolution, thematic or geographical coverage. "Large" can be usefully defined as exceeding our current capacity to deliver. We provide examples of large geographical databases. Traditional stores partition geographical data by theme and geographically. We assume that digital geographical databases will be largely archival, and will be similarly partitioned. A general model of a large archival store is presented. We analyze the properties of a generalized Morton key as a means of indexing tiles, and illustrate its role in traditional systems of tile indexing. For global databases, we propose a tiling based on recursive subdivisions of the triangular faces of an octahedron using a rule of four.


Journal ArticleDOI
01 Jun 1989
TL;DR: The method described equips researchers with the first standard simulation approach which can be used on any database system, based on the Wisconsin Bench- marks, and then provides an overview of its use.
Abstract: This paper presents a methodol ogy for performing database system simulations which is based on the Wisconsin Bench- marks Use of this approach provides very realistic represen tations for transactions, hard ware, and software aspects of a target database environment The flexibility built into the approach also facilitates exami nation of many different database environments with few changes to the basic model The method described equips researchers with the first standard simulation approach which can be used on any database system We describe the approach, its implementation using SLAM II, and then provide an overview of its use

Proceedings ArticleDOI
03 Jan 1989
TL;DR: Theoretical results in formally defining and measuring database locality are presented and a technique for adapting the program locality model to both temporal and spatial dimensions at all stages of database processing is developed.
Abstract: Theoretical results in formally defining and measuring database locality are presented. Database locality has proved less tractable than program locality, which has a long history of theoretical investigation and application in virtual memory systems and processor catches. The stages at which database locality can be observed and the differences between database and program locality are identified. A technique for adapting the program locality model to both temporal and spatial dimensions at all stages of database processing is developed. A case study of a large commercial database is used to illustrate the application of the database locality model and the interpretation of results. >

Proceedings ArticleDOI
01 Jan 1989
TL;DR: A complex object-oriented database system constructed using a physical database which is record oriented is described, and the data model includes behavioral and timing information, and is comprehensive, covering the entire design process.
Abstract: A complex object-oriented database system constructed using a physical database which is record oriented is described. The data model includes behavioral and timing information, and is comprehensive, covering the entire design process. The use of a commercial record-oriented database allowed rapid implementation of the system, supported schema changes, and provided a multiuser environment with database control support functions. Using such a database to support high-level synthesis activities is novel. >

Proceedings ArticleDOI
20 Sep 1989
TL;DR: An approach and a mechanism for the definition and maintenance of views within temporal database environments are outlined, and it is shown that temporal database views have far fewer maintenance problems than their standard relational counterparts.
Abstract: An approach and a mechanism for the definition and maintenance of views within temporal database environments are outlined. The view definition language makes use of extending Boolean and comparison operators by allowing their operands to be sets of intervals. A mechanism for maintaining temporal views is presented, and it is shown that temporal database views have far fewer maintenance problems than their standard relational counterparts. >


Proceedings ArticleDOI
20 Sep 1989
TL;DR: An approach to schema integration in a heterogeneous distributed database management system (DBMS) design is described and has been used with success in a prototype multiple database access system (MDAS) which acts as a front-end to multiple local DBMSs.
Abstract: An approach to schema integration in a heterogeneous distributed database management system (DBMS) design is described. The approach has been used with success in a prototype multiple database access system (MDAS). This system acts as a front-end to multiple local DBMSs which continue to perform all local data management and processing. The MDAS services queries on an integrated view of semantically related databases exhibiting a range of schema and data conflicts. >



Book
01 Nov 1989
TL;DR: An architectural design for a back-end database machine (DBM) suitable for supporting multiple-user, on-line, very large relational database systems (systems with capacities larger than 1010 bytes) is presented.


Book ChapterDOI
21 Jul 1989
TL;DR: SIRO-DBMS is a Spatial Information Systems database tool-kit implemented as a set of external attachments to a relational database management systems that implements user data types through parameterised definitions of the user view of additional data types and of their internal representation.
Abstract: SIRO-DBMS is a Spatial Information Systems database tool-kit implemented as a set of external attachments to a relational database management systems. It implements user data types through parameterised definitions of the user view of additional data types and of their internal representation. A spatial access method built on a 1-dimensional key and compatible with B-trees is also provided. Retrieval performance data with data sets of the sizes likely to be encountered in production systems are reported.