Article

Free access

The DEDALE system for complex spatial queries

Authors:

Stéphane Grumbach,

Philippe Rigaux,

Luc SegoufinAuthors Info & Claims

SIGMOD '98: Proceedings of the 1998 ACM SIGMOD international conference on Management of data

Pages 213 - 224

https://doi.org/10.1145/276304.276324

Published: 01 June 1998 Publication History

Abstract

This paper presents DEDALE, a spatial database system intended to overcome some limitations of current systems by providing an abstract and non-specialized data model and query language for the representation and manipulation of spatial objects. DEDALE relies on a logical model based on linear constraints, which generalizes the constraint database model of [KKR90]. While in the classical constraint model, spatial data is always decomposed into its convex components, in DEDALE holes are allowed to fit the need of practical applications. The logical representation of spatial data although slightly more costly in memory, has the advantage of simplifying the algorithms. DEDALE relies on nested relations, in which all sorts of data (thematic, spatial, etc.) are stored in a uniform fashion. This new data model supports declarative query languages, which allow an intuitive and efficient manipulation of spatial objects. Their formal foundation constitutes a basis for practical query optimization. We describe several evaluation rules tailored for geometric data and give the specification of an optimizer module for spatial queries. Except for the latter module, the system has been fully implemented upon the O₂ DBMS, thus proving the effectiveness of a constraint-based approach for the design of spatial database systems.

References

[1]

l). Abel and J.L. Smith. A Data Structure and Algorithm Based on a Linear Key for a Rectangle Retrieval Problem. Computer Vision, Graphics and Image Processing, 24:1-t3, 1983.

[2]

A . Belussi, E. Bertino, and B. Catania. Manipulating spatial data in constraint databases, in Intl. Conf. on Advances in Spatial Databases (SSD'97), pages 115-141. Springer Verlag, LNCS 1262, 1997.

Digital Library

[3]

F. {~ancilhon, S. Cluet, and C. Delobel. A Query Language for an Object-Oriented Database System. In 2nd Int. Worshop on Database Programming Languages (DBPL), pages 301-322, 1989.

Digital Library

[4]

F. Bancilhon, C. Delobel, and P. Kanellakis, editors. Building an Object-Oriented Database System: The Story of 02. Morgan Kaufmann, San Mateo, California, 1992.

Digital Library

[5]

N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger. The R'tree : An Efficient and Robust Access Method for Points and Rectangles. In Proc. A CM SIGMOD Intl. Symp. on the Management o/ Data, pages 322-331, 1990.

Digital Library

[6]

E.F. Codd. A relational model of data for large shared data banks. Communications of A CM, 13:6:377-387, 1970.

Digital Library

[7]

F. Dumortier, M. Gyssens, L. Vandeurzen, and D . Van Gucht. On the decidability of semi-linearity for semi-algebraic sets and its implications for spatial databases. In Proc. A CM Symp. on Principles o/ Database Systems, 1997.

Digital Library

[8]

.1. C. Freytag. A rule-based view of query optimization. In Proc. A CM SIGMOD Symp. on the Management of Data, pages 173-180, San Francisco, 1987.

Digital Library

[9]

V. Gaede. Optimal Redundancy in Spatial Databases Systems. In Intl. Con/. on Advances in Spatial Databases, (SSD'95), pages 96-116. Springer Verlag LNCS 951, 1995.

Digital Library

[10]

S. (}rumbach and G. Kuper. Tractable recursion over geometric data. In International Conference on Con- .straint Programming, 1997.

[11]

G. Grade. Query evaluation techniques for ~arge databases. ACM Computing Surveys, 25(2):73-170, 1993.

Digital Library

[12]

S. Grumbach, P. Rigaux, and L. Segoufin. The dedale system for complex spatial queries. Technical Report 131, INR,IA-VERSO, 1998. ftp://ftp, inria, fr/IN RIA /Projects / verso/Versol{epo r t- 131.ps.gz.

Digital Library

[13]

S. Grumbach, P. Rigaux, M. Scholl, and L. Segoufin. l)edale: A spatial constraint database. In Intl. Workshop on Database Pro.qram'ming Lang'u, ages (DBPL'97), 1997.

Digital Library

[14]

R.t{. Gfiting and M. Schneider. Realm-13 ased Spa.tial Data Types: The ROSE Algebra. The VLI){3 .lov, rnal, 4(3):243-286, 1995.

Digital Library

[15]

S. Grumbach and J. Su. Queries with arithmetical constraints. Theoretical Computer Science, 173, i997. Invited to a special issue.

Digital Library

[16]

S. Grumbach, J. Su, and C. Tollu. Linear constraizlt query languages: Expressive power and complexity. In D. Leivant, editor, Logic and Computational Complexity, Indianapolis, 1994. Springer Verlag. LNCS 960.

Digital Library

[17]

A. Guttman. R-trees: A Dynamic Index Structure for Spatial Searching, In Proc. ACM SIGMOI) Intl. Syrup. on the Management o.f Dala, pages 45 57, 1984.

Digital Library

[18]

R.tt. Gfiting. Gral: An Extensible Relational Database System for Geometric Applications. In Proc. Intl. Conf. on Very Large Data Bases (VLDB), 1989.

Digital Library

[19]

R.H. Gfiting. An Introduction to Spatial Database Systems. The VLDB Journal, 3(4), 1994.

Digital Library

[20]

J. Herring, The ORACLE 7 Spatial Data ()ption. Technical report, ORACLE Corp., 1996.

[21]

J.Patel and al. Building a scalable geo-spa~ial dbms : Technology, implementation, and evaluation. In Proc. A CM SIGMOD Symp. on the Management of Data, 1997.

Digital Library

[22]

P. Kanellakis and D. Goldin. Constraint programruing and database query languages. In Manuscr'ipt, 1994.

Digital Library

[23]

P. Kanellakis, G Kuper, and P. Revesz. Constraint, query languages. In Proe. 9th A CM Syrup. on Principles of Database Systems, pages 299-313, Nashville, 1.990.

Digital Library

[24]

B. Kuijpers, J. Paredaens, and J, Van den Bussche. Lossless representation of topological spatial data. In M. J. Egenhofer and J. R. Herring, editors, Advances in Spatial Databases, 4th Int. Syrup., S,qD'95, pages 1-13. Springer, 1995.

Digital Library

[25]

S. Morehouse. The Architecture of ARC/INFO. In Proc. Intl. Syrup. on Computer-Assisted Cartograph.y (Auto-Carto 9), pages 266-277, 1989.

[26]

J. Nievergelt, H. ttinterger, and K.C. Sevcik. The Grid File: An Adaptable Symrnetric M t,ltikey File Structure. A CM Transactions on, Database Systems, 9(1):38-71, 1984.

Digital Library

[27]

J. Orenstein and F. Manola. PROBE: Spatial Data Modeling and Query Processing in an Image Database Application. IEEE Transactions on Software Engineering, 14(5):611-628, 1988.

Digital Library

[28]

F. Preparata and M. Shamos. Computational Geometry: An introduction. Springer Verla,g, 1985.

Digital Library

[29]

J. Paredaens, J. Van den Bussche, nd D. Van Gucht. Towards a theory of spatial dat~base queries. In Froc. I3th ACM Syrup. on l~rinciplcs of Database Systems, pages 279-288, 1994.

Digital Library

[30]

N.H.oussopoulos, C. Faloutsos, and T. Sellis. An Efficient Pictorial Database System for PSQL. IEEE Transactions on Software Engineering, 14(5):639~- 65O, 1988.

Digital Library

[31]

H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley Publishing Company Inc, 1!190.

Digital Library

[32]

A. Schrijver. Theory of Linear and Integer Programruing. Wiley, 1986.

Digital Library

[33]

M. Stonebraker, J. Frew, K. Gardels, and J. Meredi~:t~. The Sequoia 2000 Benchmark. In Proc. A CM SI(;MOI) Intl. Symp. on the Management of Data, 1993.

Digital Library

[34]

M. Schotl, G. Grangeret, and X. Rehse. Point and window queries with linear spatial indices: An evaluation with 02. Technical Report RRC-96- 09, Cedric Lab, CNAM, Paris, 1996. Available at ht t p: //si k kim. cnam .fr.

[35]

T. Sellis, N. Roussopoulos, and C. Paloutsos. The t l t-Tree: A Dynamic Index for Multi-Dimensional ()bjects. In Proc. Intl. Conf. on Very Large Data Hases (VLDB), pages 507-518, 1987.

Digital Library

[36]

M. Scholl and A. Voisard. Thematic Map Modeling. In Proc. Intl. Syrup. on Large Spatial Databases (,5"5'D), LNCS No. 409, pages 167-192. Springer- Verlag, 1989.

Digital Library

[37]

C.D. Tomlin. Geographic information Systems and Cartographic Modeling. Prentice-Hall, 1990.

[38]

M. U bell. The Montage Extensible DataBlade Architecture. In Proc. A CM SIGMOD Intl. Conference on Management of Data, 1994.

Digital Library

[39]

J.D. Ullman. Database and Knowledge Base Systems. Computer Science Press, 1988.

Digital Library

Cited By

Reznichenko V(2021)60 Years of Databases (part two)PROBLEMS IN PROGRAMMING10.15407/pp2021.04.036(036-061)Online publication date: Dec-2021
https://doi.org/10.15407/pp2021.04.036
Veanes MBjørner NNachmanson LBereg S(2017)Monadic DecompositionJournal of the ACM10.1145/304048864:2(1-28)Online publication date: 30-Apr-2017
https://dl.acm.org/doi/10.1145/3040488
Ramaiah MRay B(2015)Polygonal approximation of digital planar curve using local integral deviationInternational Journal of Computational Vision and Robotics10.1504/IJCVR.2015.0713335:3(302-319)Online publication date: 1-Aug-2015
https://dl.acm.org/doi/10.1504/IJCVR.2015.071333
Show More Cited By

Index Terms

The DEDALE system for complex spatial queries

Recommendations

The DEDALE system for complex spatial queries

This paper presents DEDALE, a spatial database system intended to overcome some limitations of current systems by providing an abstract and non-specialized data model and query language for the representation and manipulation of spatial objects. DEDALE ...
Selectivity Estimation of Complex Spatial Queries
SSTD '01: Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases

Several studies have focused on the efficient processing of simple spatial query types such as selections and spatial joins. Little work, however, has been done towards the optimization of queries that process several spatial inputs and combine them ...
A Taxonomy for Distance-Based Spatial Join Queries

Join operation is one of the most used operations in database management systems, including spatial databases. Hence, spatial join queries are very important in spatial database processing. There are many different kinds of spatial join queries, due to ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGMOD '98: Proceedings of the 1998 ACM SIGMOD international conference on Management of data

June 1998

599 pages

ISBN:0897919955

DOI:10.1145/276304

Chairmen:
Laura Haas
IBM AlmadenResearch Center, San Jose, CA
,
Pamela Drew
Boeing Co.
,
Editors:
Ashutosh Tiwary
Boeing Co.; and Univ. of Washington, Seattle
,
Michael Franklin
Univ. of Maryland, College Park

ACM SIGMOD Record Volume 27, Issue 2
June 1998
595 pages
ISSN:0163-5808
DOI:10.1145/276305
Chairmen:
Laura Haas
IBM Almaden Research Center, San Jose, CA
,
Pamela Drew
Boeing Co.
,
Editor:
Ashutosh Tiwary
Boeing Co.; and Univ. of Washington, Seattle
Issue’s Table of Contents

Copyright © 1998 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1998

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMOD/PODS98

Sponsor:

SIGMOD/PODS98: Special Interest Group on Management of Data

June 1 - 4, 1998

Washington, Seattle, USA

Acceptance Rates

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

95
Total Citations
View Citations
691
Total Downloads

Downloads (Last 12 months)120
Downloads (Last 6 weeks)20

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Reznichenko V(2021)60 Years of Databases (part two)PROBLEMS IN PROGRAMMING10.15407/pp2021.04.036(036-061)Online publication date: Dec-2021
https://doi.org/10.15407/pp2021.04.036
Veanes MBjørner NNachmanson LBereg S(2017)Monadic DecompositionJournal of the ACM10.1145/304048864:2(1-28)Online publication date: 30-Apr-2017
https://dl.acm.org/doi/10.1145/3040488
Ramaiah MRay B(2015)Polygonal approximation of digital planar curve using local integral deviationInternational Journal of Computational Vision and Robotics10.1504/IJCVR.2015.0713335:3(302-319)Online publication date: 1-Aug-2015
https://dl.acm.org/doi/10.1504/IJCVR.2015.071333
Bimonte SKang MPaolino LSebillo MZaamoune MVitiello G(2014)OLAPing Field DataFundamenta Informaticae10.5555/2637688.2637694132:2(267-290)Online publication date: 1-Apr-2014
https://dl.acm.org/doi/10.5555/2637688.2637694
Sarma ALee HGonzalez HMadhavan JHalevy A(2013)Consistent thinning of large geographical data for map visualizationACM Transactions on Database Systems10.1145/2539032.253903438:4(1-35)Online publication date: 4-Dec-2013
https://dl.acm.org/doi/10.1145/2539032.2539034
Das Sarma ALee HGonzalez HMadhavan JHalevy ACandan KChen YSnodgrass RGravano LFuxman A(2012)Efficient spatial sampling of large geographical tablesProceedings of the 2012 ACM SIGMOD International Conference on Management of Data10.1145/2213836.2213859(193-204)Online publication date: 20-May-2012
https://dl.acm.org/doi/10.1145/2213836.2213859
Carmona-Poyato AMedina-Carnicer RFernandez-Garcia NMadrid-Cuevas FMuñoz-Salinas R(2010)Method for polygonal approximation through dominant points deletionProceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part III10.5555/1945955.1945997(350-358)Online publication date: 1-Jun-2010
https://dl.acm.org/doi/10.5555/1945955.1945997
Zhang CHuang Y(2010)Querying streaming point clusters as regionsProceedings of the ACM SIGSPATIAL International Workshop on GeoStreaming10.1145/1878500.1878510(43-50)Online publication date: 2-Nov-2010
https://dl.acm.org/doi/10.1145/1878500.1878510
Paolino LSebillo MTortora GVitiello G(2010)Integrating Discrete and Continuous Data in an OpenGeospatial-Compliant SpecificationTransactions in GIS10.1111/j.1467-9671.2010.01231.x14:6(731-753)Online publication date: 7-Dec-2010
https://doi.org/10.1111/j.1467-9671.2010.01231.x
Carmona-Poyato AMadrid-Cuevas FMedina-Carnicer RMuñoz-Salinas R(2010)Polygonal approximation of digital planar curves through break point suppressionPattern Recognition10.1016/j.patcog.2009.06.01043:1(14-25)Online publication date: 1-Jan-2010
https://dl.acm.org/doi/10.1016/j.patcog.2009.06.010
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents