Constraint-based interoperability of spatiotemporal databases
Lecture notes in computer sciencePublished 1 January 1997
Jan Chomicki, Péter Révész
Citations41
SJR quartileQ2
SJR score0.35
SNIP0.55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This work proposes constraint databases as an intermediate level facilitating the interoperability of spatiotemporal data models and illustrates the approach in the context of a number of temporal, spatial and spatioterpine data models.
Abstract
We propose constraint databases as an intermediate level facilitating the interoperability of spatiotemporal data models. Constraint query languages are used to express translations between different data models. We illustrate our approach in the context of a number of temporal, spatial and spatiotemporal data models.
Keywords
Computer Science
Computational Geometry
3,606 Citations1985Franco P. Preparata, Michael Ian Shamos
This book clearly demonstrates that computational geometry in the plane is now a fairly well-understood branch of computer science and mathematics and points the way to the solution of the more challenging problems in dimensions higher than two.
Computational geometry. an introduction
2,369 Citations1985Franco P. Preparata, Michael Ian Shamos
Elsevier eBooksFundamentals of Spatial Information Systems
712 Citations1992
This book describes the construction of donnees spatiales and their role in the geomatique, as well as some of the mechanisms used to design and construct them.
Journal of Computer and System SciencesConstraint Query Languages
679 Citations1995Paris C. Kanellakis, Gabriel M. Kuper +1 more
It is shown that efficient, declarative database programming can be combined with efficient constraint solving and the key intuition is that the generalization of a ground fact is a conjunction of constraints over a small number of variables.
The TSQL2 Temporal Query Language
633 Citations1995Richard T. Snodgrass
To break the boredom in reading, one that the authors will refer to is choosing tsql2 temporal query language as the reading material.
Digital Commons - UMaine (University of Maine)GIS : a computing perspective
628 Citations2004Mike Worboys, Matt Duckham
A Brief History of Time Temporal Information Systems Spatiotemporal Information systems Indexes and Queries Appendices.
ACM Transactions on Database SystemsThe temporal query language TQuel
607 Citations1987Richard T. Snodgrass
The language informally is discussed, the semantics of the TQuel statements that differ from their Quel counterparts are provided, including the modification statements, and TQuel is compared with ten other query languages supporting time.
Lecture notes in computer scienceTheories and Methods of Spatio-Temporal Reasoning in Geographic Space
451 Citations1992Andrew U. Frank, Irene Campari
This is a perfect book that comes from great author to share with you and offers the best experience and lesson to take, not only take, but also learn.
The Computer JournalA Unified Model for Spatial and Temporal Information
356 Citations1994Mike Worboys
A unified generic model for information which is referenced to two spatial dimensions and two temporal dimensions (database and event times) is discussed.
Distributed and Parallel DatabasesOn resolving schematic heterogeneity in multidatabase systems
199 Citations1993Won Bae Kim, Injun Choi +2 more
The classification of conflict resolution techniques includes not only those necessary for resolving schematic conflicts identified in the earlier paper, but also additional conflicts that arise when OODBs become part of the databases to be integrated.
Lecture notes in computer scienceTemporal query languages: A survey
171 Citations2005Jan Chomicki
This work defines formal notions of temporal domain and temporal database, and uses them to survey a wide spectrum of temporal query languages and addresses the issue of incomplete temporal information.
Literary and Linguistic ComputingJournal of Logic Programming
155 Citations1993Maurice Bruynooghe, James A. Robinson
Handling infinite temporal data
145 Citations1990F. Kabanza, J.-M. Stevenne +1 more
It is proved that relations formed from generalized tuples are closed under the operations of relational algebra, and a characterization of the expressiveness of generalized relations is given in terms of predicates definable in Presburger arithmetic.
Temporal Deductive Databases.
111 Citations1993Marianne Baudinet, Jan Chomicki +1 more
A number of approaches to the problem of nite representation of innnite temporal extensions of Datalog 1S and Templog are surveyed, providing precise characterizations of the expressiveness and the computational complexity of these languages.
Towards a theory of spatial database queries (extended abstract)
106 Citations1994Jan Paredaens, Jan Van den Bussche +1 more
ACM Computing SurveysAn analysis of geometric modeling in database systems
103 Citations1987Alfons Kemper, Mechtild Wallrath
The data-modeling and computational requirements for integrated computer aided manufacturing (CAM) databases are analyzed, and the most common representation schemes for modeling solid geometric objects in a computer are described.
Lecture notes in computer scienceConstraint programming and database query languages
87 Citations1994Paris C. Kanellakis, Dina Goldin
This overview of constraint query languages (CQLs) presents an algebra for dense order constraints that is simpler to evaluate than the calculus described in [KKR], and sharpen some of the related data complexity bounds.
Annals of Mathematics and Artificial IntelligenceSubsumption and indexing in constraint query languages with linear arithmetic constraints
65 Citations1993Divesh Srivastava
It is shown that the problem of subsumption in CQLs with linear arithmetic constraints is co-NP complete, and a deterministic algorithm is presented, based on the divide and conquer strategy, for this problem.
Lecture notes in computer scienceExtending a DBMS with spatial operations
59 Citations1991Walid G. Aref, Hanan Samet
A data architecture that matches the requirements for efficient processing of spatial queries in the extended database environment is proposed and provides an equal opportunity for both the spatial components and the non-spatial components of the data to participate in query processing and optimization.
On the representation of infinite temporal data and queries (extended abstract)
58 Citations1991Marianne Baudinet, Marc Niézette +1 more
This chapter discusses how to store a temporal predicate in a database using a formalism that allows the finite representation of at least some infinite temporal extensions.
AI MagazineThe 1993 International Logic Programming Symposium
57 Citations1994Verónica Dahl
The 1993 International Logic Programming Symposium was held in Vancouver, British Columbia, on 26-29 October, and presented the state of the art in logic programming, emphasizing the deliberate interaction with other fields, in particular, humanistic fields.
Querying constraints
54 Citations1990Jean-Louis Lassez
It is shown how one can design a querying system for sets of linear constraints by using basic concepts from logic programming and symbolic computation, as well as algorithms from linear programming and computational geometry.
Aggregation in Constraint Databases.
49 Citations1993Gabriel M. Kuper
It is shown how aggregation could be added to the query language, tuple calculus, and the problems that arise from the interaction of aggregate operators and constraints are discussed.
Lecture notes in computer scienceLinear vs. polynomial constraints in database query languages
48 Citations1994Foto Afrati, Stavros S. Cosmadakis +2 more
Positive and negative results on the expressive power of the relational calculus augmented with linear constraints are proved and the non-expressibility of some properties expressed by polynomial constraints is shown.
The LyriC language
47 Citations1995Alexander Brodsky, Yoram Kornatzky
The proposed LyriC language is designed to provide a uniform and flexible framework for diverse application realms such as constraint-based design in two-, three-dimensional space, large-scale optimization and analysis, based mostly on linear programming techniques, and spatial and geographic databases.
Journal of Computer and System SciencesHandling Infinite Temporal Data
46 Citations1995F. Kabanza, J.-M. Stevenne +1 more
This framework is an extension of classical relational databases that represents infinite temporal information by generalized tuples defined by linear repeating points and constraints on these points and it is proved that relations formed from generalized tuples are closed under the operations of relational algebra.
The Journal of Logic ProgrammingDatalog with integer periodicity constraints
42 Citations1998David Toman, Jan Chomicki
A closed-form bottom-up evaluation procedure for the class of periodic constraints combined with gap-order constraints in the framework of Datalog is developed and complexity bounds are provided for the query evaluation procedures.
Temporal modules
38 Citations1993X. Sean Wang, Sushil Jajodia +1 more
A federated temporal database model and its query language are proposed and the query language is an extension of the above calculus-style language to resolve another type of mismatch among the constituents of a federation.
Finitely representable databases (extended abstract)
37 Citations1994Stéphane Grumbach, Jianwen Su
This work investigates the theory of finitely representable models and proves that it differs strongly from both classical model theory and finite model theory, and shows that most of the well known theorems of either one fail.
Lecture notes in computer scienceDatalog queries of set constraint databases
36 Citations1995Péter Révész
Datalog⊂P(Z) queries over set constraint databases are shown to be evaluable bottom-up in closed form and to have DEXPTIME-complete data complexity.
Journal of Computer and System SciencesFinitely Representable Databases
33 Citations1997Stéphane Grumbach, Jianwen Su
The theory of finitely representable models is investigated and it is proved that it differs from both classical model theory and finite model theory, and most of the well-known theorems of logic are shown to be failures.
Dense-order constraint databases (extended abstract)
30 Citations1995Stéphane Grumbach, Jianwen Su
This work provides in particular an exact characterization of the class of dense order queries computable in PTIME (data complexity), and proves that region and graph connectivity queries are not definable with linear constraints.
Separability of polyhedra for optimal filtering of spatial and constraint data
29 Citations1995Alexander Brodsky, Catherine Lassez +2 more
The Journal of Logic ProgrammingPushing constraint selections
27 Citations1993Divesh Srivastava, Raghu Ramakrishnan
Unification of temporal data models
26 Citations2002Christian S. Jensen, Michael D. Soo +1 more
A conceptual temporal data model that captures the time-dependent semantics of data while permitting multiple data models at the representation level is described and a tuple-timestamped first normal form representation is introduced to show how the conceptual bitemporal data model is related to representational models.
Lecture notes in computer scienceOn the desirability and limitations of linear spatial database models
24 Citations1995Luc Vandeurzen, Marc Gyssens +1 more
It is established that no reasonable safe extension of the data manipulation language can be complete for the linear spatial queries in that even very simple queries such as deciding colinearity or computing convex hull of a finite set of points cannot be expressed.
Measuring infinite relations
24 Citations1995Jan Chomicki, Gabriel M. Kuper
A new aggregation operator P.LL for constraint databases that makes it possible to measure infinite subsets of the n-dimensional space defined by constraints is defined and it is shown that relational algebra augmented with .LL is closed in the real case and in the integer case as well.
Semantic assumptions and query evaluation in temporal databases
21 Citations1995Cláudio Bettini, X. Sean Wang +2 more
The paper gives a translation procedure and studies the properties (safety in particular) of user queries and system queries, and formalizes and studies two types of semantic assumptions: point-based and interval-based.
Lecture notes in computer scienceFrom extensible databases to interoperability between multiple databases and GIS applications
18 Citations1993Hans-J. Schek, Andreas Wolf
This paper shows that its generalisation in an open distributed environment well supports the exchange of either (foreign) data or of ( foreign) operations between multiple geo-databases and several GIS application systems and in particular between databases and application-specific computation services.
Very Large Data BasesData Integration in the Large: The Challenge of Reuse
18 Citations1994Arnon Rosenthal, Leonard J. Seligman
This paper identifies and examines issues of maximing information and code reuse by organizations facing data integration in the large, and identifies ways to reuse integration metadata across integration efforts.
Lecture notes in computer scienceInteroperability of spatial and attribute data managers: A case study
7 Citations1993Curtis P. Kolovson, Marie-Anne Neimat +1 more