Centre de documentation
scientifique

Query processing in spatial databases containing obstacles / Jun Zhang in International journal of geographical information science IJGIS, vol 19 n° 10 (november 2005)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 19 n° 10 (november 2005) . - pp 1091 - 1111 Titre : Query processing in spatial databases containing obstacles Type de document : Article/Communication Auteurs : Jun Zhang, Auteur ; Dimitris Papadias, Auteur ; et al., Auteur Année de publication : 2005 Article en page(s) : pp 1091 - 1111 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] appariement de graphes [Termes IGN] arbre-R [Termes IGN] barycentre [Termes IGN] base de données localisées [Termes IGN] distance euclidienne [Termes IGN] jointure spatiale [Termes IGN] plus proche voisin, algorithme du [Termes IGN] relation topologique [Termes IGN] requête spatiale Résumé : (Auteur) Despite the existence of obstacles in many database applications, traditional spatial query processing assumes that points in space are directly reachable and utilizes the Euclidean distance metric. In this paper, we study spatial queries in the presence of obstacles, where the obstructed distance between two points is defined as the length of the shortest path that connects them without crossing any obstacles. We propose efficient algorithms for the most important query types, namely, range search, nearest neighbours, e-distance joins, closest pairs and distance semi-joins, assuming that both data objects and obstacles are indexed by R-trees. The effectiveness of the proposed solutions is verified through extensive experiments. Numéro de notice : A2005-501 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1080/13658810500286935 En ligne : https://doi.org/10.1080/13658810500286935 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=27637 [article]

Exemplaires(2)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
079-05091	RAB	Revue	Centre de documentation	En réserve L003	Disponible
079-05092	RAB	Revue	Centre de documentation	En réserve L003	Disponible

Complex spatial query processing / Nikos Mamoulis in Geoinformatica, vol 8 n° 4 (December 2004)  

Public [article]  inGeoinformatica > vol 8 n° 4 (December 2004) . - pp 311 - 346 Titre : Complex spatial query processing Type de document : Article/Communication Auteurs : Nikos Mamoulis, Auteur ; Dimitris Papadias, Auteur ; D. Arkoumanis, Auteur Année de publication : 2004 Article en page(s) : pp 311 - 346 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées [Termes IGN] base de données localisées [Termes IGN] jointure spatiale [Termes IGN] optimisation (mathématiques) [Termes IGN] requête spatiale Résumé : (Auteur) The user of a Geographical Information System is not limited to conventional spatial selections and joins, but may also pose more complicated and descriptive queries. In this paper, we focus on the efficient processing and optimization of complex spatial queries that involve combinations of spatial selections and joins. Our contribution is manifold; we first provide formulae that accurately estimate the selectivity of such queries. These formulae, paired with cost models for selections and joins can be used to combine spatial operators in an optimal way. Second, we propose algorithms that process spatial joins and selections simultaneously and are typically more efficient than combinations of simple operators. Finally we study the problem of optimizing complex spatial queries using these operators, by providing (i) cost models, and (ii) rules that reduce the optimization space significantly. The accuracy of the selectivity models and the efficiency of the proposed algorithms are evaluated through experimentation. Numéro de notice : A2004-391 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1023/B:GEIN.0000040830.73424.f0 En ligne : https://doi.org/10.1023/B:GEIN.0000040830.73424.f0 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=26918 [article]

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
057-04041	RAB	Revue	Centre de documentation	En réserve L003	Disponible

Search algorithms for multiway spatial joins / Dimitris Papadias in International journal of geographical information science IJGIS, vol 16 n° 7 (october 2002)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 16 n° 7 (october 2002) . - pp 613 - 639 Titre : Search algorithms for multiway spatial joins Type de document : Article/Communication Auteurs : Dimitris Papadias, Auteur ; D. Arkoumanis, Auteur Année de publication : 2002 Article en page(s) : pp 613 - 639 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées [Termes IGN] arbre-R [Termes IGN] jointure spatiale [Termes IGN] recherche heuristique [Termes IGN] requête spatiale [Termes IGN] temps réel Résumé : (Auteur) This paper deals with multiway spatial joins when (i) there is limited time for query processing and the goal is to retrieve the best possible solutions within this limit (ii) there is unlimited time and the goal is to retrieve a single exact solution, if such a solution exists, or the best approximate one otherwise. The first case is motivated by the high cost of join processing in real-time systems involving large amounts of multimedia data, while the second one is motivated by applications that require 'negative' examples. We propose several search algorithms for query processing under theses conditions. For the limited-time case we develop some non-deterministic search heuristics that can quickly retrieve good solutions. However, these heuristics are not guaranteed to find the best solutions, even without a time limit. Therefore, for the unfirnited-time case we describe systematic search algorithms tailored specifically for the efficient retrieval of a single solution. Both types of algorithms are integrated with R-trees in order to prune the search space. Our proposal is evaluated with extensive experimental comparison. Numéro de notice : A2002-209 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1080/13658810210138733 En ligne : https://doi.org/10.1080/13658810210138733 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=22124 [article]

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
079-02071	RAB	Revue	Centre de documentation	En réserve L003	Disponible

Advances in spatial data bases, SSD '99, 6th International Symposium, Hong Kong, China, July 20-23, 1999 / Ralf Hartmut Güting (1999)  

Public Titre : Advances in spatial data bases, SSD '99, 6th International Symposium, Hong Kong, China, July 20-23, 1999 : Proceedings Type de document : Actes de congrès Auteurs : Ralf Hartmut Güting, Éditeur scientifique ; Dimitris Papadias, Éditeur scientifique ; F. Lochovsky, Éditeur scientifique Editeur : Berlin, Heidelberg, Vienne, New York, ... : Springer Année de publication : 1999 Collection : Lecture notes in Computer Science, ISSN 0302-9743 num. 1651 Conférence : SSD 1999, 6th International Symposium Advances in spatial data bases 20/07/1999 23/07/1999 Hong Kong Chine Proceedings Springer Importance : 370 p. Format : 15 x 23 cm ISBN/ISSN/EAN : 978-3-540-66247-1 Note générale : accessible ISTEX Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées [Termes IGN] base de données localisées [Termes IGN] données spatiotemporelles [Termes IGN] exploration de données géographiques [Termes IGN] histogramme [Termes IGN] hypercarte [Termes IGN] incertitude des données [Termes IGN] indexation spatiale [Termes IGN] jointure spatiale [Termes IGN] représentation multiple [Termes IGN] requête spatiale Note de contenu : Invited Talks - Topological Queries / Christos H. Papadimitriou (University of California, Berkeley) - Research Issues in Spatiotemporal Database Systems / Timos Sellis (National Technical University of Athens) - Looking Both Ways: SSD 1999 ± 10 / Oliver Giinther (Humboldt University Berlin and Pôle Universitaire Leonard de Vinci, Paris) Multiresolution and Scale - Generalizing Graphs Using Amalgamation and Selection / John G. Stell, Michael F. Worboys (Keele University) - Data Structures for Simplicial Multicomplexes / Leila De Floriani, Paola Magillo, Enrico Puppo (Universitti di Genova) - Spatial Indexing with a Scale Dimension / Mike Hörhammer (University of California, Santa Barbara), Michael Freeston (University of California, Santa Barbara, and University of Aberdeen, Scotland) Indexing - XZOrdering : A SpaceFilling Curve for Objects with Spatial Extension / Christian Böhm, Gerald Klump, HansPeter Kriegel (University of Munich) - GBI : A Generalized RTree BulkInsertion Strategy / Rupesh Choubey, LZ Chen, Elke A. Rundensteiner (Worcester Polytechnic Institute) Moving Objects and Spatiotemporal Data - Capturing the Uncertainty of MovingObject Representations / Dieter Pfoser, Christian S. Jensen (Aalborg University) - Dynamic Spatial Clustering for Intelligent Mobile Information Sharing and Dissemination / Eddie C. Shek, Giovanni Giuffrida, Suhas Josh%, Son K. Dao (Information Sciences Laboratory Malibu) - On the Generation of Spatiotemporal Datasets / Yannis Theodoridis (Computer Technology Institute Patras), Jefferson R. 0. Silva, Mario A. Nascimento (State University of Campinas) Spatial Data Mining and Classification - Efficient Polygon Amalgamation Methods for Spatial OLAP and Spatial Data Mining / Xiaofang Zhou (University of Queensland), David Truffet (CSIR0, Canberra), Jiawez Han (Simon Fraser University) - Efficiently Matching Proximity Relationships in Spatial Databases / Xuemin Lin, Xiaomei Zhou (University of New South Wales), Chengfei Liu (University of Technology Sydney) - 3D Shape Histograms for Similarity Search and Classification in Spatial Databases / Mihael Ankerst, Gabi Kastenmidler, HansPeter Kriegel, Thomas Seidl (University of Munich) Spatial Join - Multiway Spatial Joins Using RTrees: Methodology and Performance Evaluation / HoHyun Park (KAIST, Korea), GuangHo Cha (IBM Almaden Research Center), Chin Wan Chung (KAIST, Korea) - Algorithms for Joining RI)rees and Linear Region Quadtrees / Antonio Corral, Michael Vassilakopoulos, Yannis Manolopoulos (Aristotle University Thessaloniki) - Algorithms for Performing Polygonal Map Overlay and Spatial Join on Massive Data Sets / Ludger Becker, Andr6 Giesen, Klaus H. Hinrichs, Jan Vahrenhold (Universitdt Miinster) - A Performance Evaluation of Spatial Join Processing Strategies / Apostolos Papadopoulos (Aristotle University Thessaloniki), Philippe Rigaux, Michel Scholl (Cedric I CNAM Paris) Uncertainty and Geologic Hypermaps - Abduction and Deduction in Geologic Hypermaps / Agn~s Voisard (Preie Universitdt Berlin) - Uncertainty Management for Spatial Data in Databases: Fuzzy Spatial Data Types / Markus Schneider (Fern Universitdt Hagen) Industrial and Visionary Applications Track - Oracle8i Spatial: Experiences with Extensible Databases / Siva Ravada, Jayant Sharma (Oracle Corporation) - SICC: An Exchange System for Cadastral Information / Maurizio Talamo (AIPA Rome and University of Rome "La Sapienza") Pranco Arcieri (AIPA Rome), Giancarlo Conia (SOGEI Rome), Enrico Nardelli (University of LAquila) - Requirements of Traffic Telematics to Spatial Databases / Thomas Brinkhoff (Fachhochschule Oldenburg) Numéro de notice : 13169 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Actes DOI : 10.1007/3-540-48482-5 En ligne : https://doi.org/10.1007/3-540-48482-5 Format de la ressource électronique : URL Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=34622

Contient

• Generalizing graphs using amalgamation and selection / J.G. Stell (20/07/1999)  
• GBI : a generalized R-tree bulk-insertion strategy / R. Choubey (20/07/1999)  
• Efficient polygon amalgamation methods for spatial OLAP and spatial data mining / X. Zhou (20/07/1999)  
• 3D shape histograms for similarity search and classification in spatial databases / M. Ankerst (20/07/1999)  
• Algorithms for joining R-trees and linear region quadtrees / A. Corral (20/07/1999)  
• Uncertainty management for spatial data in databases: fuzzy spatial data types / Markus Schneider (1999)  

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
13169-01	CG.99	Livre	Centre de documentation	Congrès	Disponible