PREPROCESSING QUERIES WITH SPATIAL CONSTRAINTS

被引:0
|
作者
EGENHOFER, MJ [1 ]
机构
[1] UNIV MAINE, DEPT COMP SCI, DEPT SURVEYING ENGN, ORONO, ME 04469 USA
来源
关键词
D O I
暂无
中图分类号
P9 [自然地理学];
学科分类号
0705 ; 070501 ;
摘要
This paper discusses strategies for pre-processing spatial queries before executing them in a geographic database. A computational method has been devised, which is capable of assessing whether or not a spatial query is consistent, i.e., that its constraints are free of any self-contradictions. If the query is inconsistent, it can be rejected immediately without a need to process it in the database. The query evaluation is based on algebraic properties of spatial relations such as symmetry, converseness, transitivity, and composition, and it employs constraint propagation in a constraint network to detect conflicts. Examples are given for how this method works for spatial queries with constraints about topological relations, for which a comprehensive algebraic formalization exists.
引用
收藏
页码:783 / 790
页数:8
相关论文
共 50 条
  • [21] Learning constraints through partial queries
    Bessiere, Christian
    Carbonnel, Clement
    Dries, Anton
    Hebrard, Emmanuel
    Katsirelos, George
    Narodytska, Nina
    Quimper, Claude-Guy
    Stergiou, Kostas
    Tsouros, Dimosthenis C.
    Walsh, Toby
    ARTIFICIAL INTELLIGENCE, 2023, 319
  • [22] Processing distance join queries with constraints
    Papadopoulos, AN
    Nanopoulos, A
    Manolopoulos, Y
    COMPUTER JOURNAL, 2006, 49 (03): : 281 - 296
  • [23] Processing distance join queries with constraints
    Papadopoulos, Apostolos N.
    Nanopoulos, Alexandros
    Manolopoulos, Yannis
    Computer Journal, 2006, 49 (03): : 281 - 296
  • [24] Safe Datalog queries with linear constraints
    Revesz, PZ
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP98, 1998, 1520 : 355 - 369
  • [25] XML queries and constraints, containment and reformulation
    Deutsch, A
    Tannen, V
    THEORETICAL COMPUTER SCIENCE, 2005, 336 (01) : 57 - 87
  • [26] Preprocessing an undirected planar network to enable fast approximate distance queries
    Klein, P
    PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2002, : 820 - 827
  • [27] Linear processing of spatial queries
    Oria, V
    Saglio, JM
    CARI'96 - PROCEEDINGS OF THE 3RD AFRICAN CONFERENCE ON RESEARCH IN COMPUTER SCIENCE, 1996, : 582 - 593
  • [28] The Farthest Spatial Skyline Queries
    You, Gae-won
    Lee, Mu-Woong
    Im, Hyeonseung
    Hwang, Seung-won
    INFORMATION SYSTEMS, 2013, 38 (03) : 286 - 301
  • [29] Spatial queries in dynamic environments
    Tao, YF
    Papadias, D
    ACM TRANSACTIONS ON DATABASE SYSTEMS, 2003, 28 (02): : 101 - 139
  • [30] Topological queries in spatial databases
    Papadimitriou, CH
    Suciu, D
    Vianu, V
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1999, 58 (01) : 29 - 53