Descripteur
Termes IGN > informatique > base de données > requête (informatique) > requête spatiale
requête spatiale |
Documents disponibles dans cette catégorie (161)
Ajouter le résultat dans votre panier
Visionner les documents numériques
Affiner la recherche Interroger des sources externes
Etendre la recherche sur niveau(x) vers le bas
The direction-constrained k nearest neighbor query dealing with spatio-directional objects / Min-Joong Lee in Geoinformatica, vol 20 n° 3 (July - September 2016)
[article]
Titre : The direction-constrained k nearest neighbor query dealing with spatio-directional objects Type de document : Article/Communication Auteurs : Min-Joong Lee, Auteur ; Dong-Wan Choi, Auteur ; SangYeon Kim, Auteur ; et al., Auteur Année de publication : 2016 Article en page(s) : pp 471 – 502 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées
[Termes IGN] analyse coût-avantage
[Termes IGN] classification barycentrique
[Termes IGN] données massives
[Termes IGN] index spatial
[Termes IGN] objet géographique
[Termes IGN] plus proche voisin, algorithme du
[Termes IGN] requête spatialeRésumé : (auteur) Finding k nearest neighbor objects in spatial databases is a fundamental problem in many geospatial systems and the direction is one of the key features of a spatial object. Moreover, the recent tremendous growth of sensor technologies in mobile devices produces an enormous amount of spatio-directional (i.e., spatially and directionally encoded) objects such as photos. Therefore, an efficient and proper utilization of the direction feature is a new challenge. Inspired by this issue and the traditional k nearest neighbor search problem, we devise a new type of query, called the direction-constrained k nearest neighbor (DCkNN) query. The DCkNN query finds k nearest neighbors from the location of the query such that the direction of each neighbor is in a certain range from the direction of the query. We develop a new index structure called MULTI, to efficiently answer the DCkNN query with two novel index access algorithms based on the cost analysis. Furthermore, our problem and solution can be generalized to deal with spatio-circulant dimensional (such as a direction and circulant periods of time such as an hour, a day, and a week) objects. Experimental results show that our proposed index structure and access algorithms outperform two adapted algorithms from existing kNN algorithms. Numéro de notice : A2016-378 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-016-0245-2 En ligne : http://dx.doi.org/10.1007/s10707-016-0245-2 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=81145
in Geoinformatica > vol 20 n° 3 (July - September 2016) . - pp 471 – 502[article]A hybrid link-node approach for finding shortest paths in road networks with turn restrictions / Qingquan Li in Transactions in GIS, vol 19 n° 6 (December 2015)
[article]
Titre : A hybrid link-node approach for finding shortest paths in road networks with turn restrictions Type de document : Article/Communication Auteurs : Qingquan Li, Auteur ; Bi Yu Chen, Auteur ; Yafei Wang, Auteur ; William H. K. Lam, Auteur Année de publication : 2015 Article en page(s) : pp 915 - 929 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique
[Termes IGN] analyse comparative
[Termes IGN] calcul d'itinéraire
[Termes IGN] chemin le plus court, algorithme du
[Termes IGN] navigation automobile
[Termes IGN] noeud
[Termes IGN] requête spatiale
[Termes IGN] réseau routier
[Termes IGN] traitement de données localiséesRésumé : (auteur) Turn restrictions, such as ‘no left turn’ or ‘no U-turn’, are commonly encountered in real road networks. These turn restrictions must be explicitly considered in the shortest path problem and ignoring them may lead to infeasible paths. In the present study, a hybrid link-node Dijkstra's (HLND) algorithm is proposed to exactly solve the shortest path problem in road networks with turn restrictions. A new hybrid link–node labelling approach is devised by using a link–based labelling strategy at restricted nodes with turn restrictions, and a node-based labelling strategy at unrestricted nodes without turn restrictions. Computational results for several real road networks show that the proposed HLND algorithm obtains the same optimal results as the link-based Dijkstra's algorithm, while having a similar computational performance to the classical node-based Dijkstra's algorithm. Numéro de notice : A2016-438 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/tgis.12133 En ligne : http://dx.doi.org/10.1111/tgis.12133 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=81349
in Transactions in GIS > vol 19 n° 6 (December 2015) . - pp 915 - 929[article]The TM-RTree: an index on generic moving objects for range queries / Jianqiu Xu in Geoinformatica, vol 19 n° 3 (July - September 2015)
[article]
Titre : The TM-RTree: an index on generic moving objects for range queries Type de document : Article/Communication Auteurs : Jianqiu Xu, Auteur ; Ralf Hartmut Güting, Auteur ; Yu Zheng, Auteur Année de publication : 2015 Article en page(s) : pp 487 - 524 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique web
[Termes IGN] arbre-R
[Termes IGN] distance
[Termes IGN] données spatiotemporelles
[Termes IGN] index spatial
[Termes IGN] objet mobile
[Termes IGN] requête spatiale
[Termes IGN] transportRésumé : (auteur) Existing works on moving objects mainly focus on a single environment such as free space and road network, and do not investigate the complete trip for humans who can pass several environments, e.g., road network, pavement areas, indoor. In this paper, we consider multiple environments and study moving objects with different transportation modes, also called generic moving objects. We aim to answer a new class of queries supporting three kinds of conditions: temporal, spatial, and transportation modes. To efficiently provide the result, we propose an index structure called TM-RTree, which takes into account the feature of moving objects in different environments and has the capability of managing objects on not only temporal and spatial data but also transportation modes. This property is not maintained by existing indices for moving objects. Different cases on transportation modes are supported. Correspondingly, several algorithms are developed. The TM-RTree and related algorithms are developed in a real DBMS to have a practical and solid result for applications. In the experiment, we conduct the performance evaluation using extensive datasets and compare the proposed technique with the other two competitors, demonstrating the efficiency and significant superiority of our solution in various settings. Numéro de notice : A2015-496 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-014-0218-2 Date de publication en ligne : 11/09/2014 En ligne : https://doi.org/10.1007/s10707-014-0218-2 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=77308
in Geoinformatica > vol 19 n° 3 (July - September 2015) . - pp 487 - 524[article]GMOBench: Benchmarking generic moving objects / Jianqiu Xu in Geoinformatica, vol 19 n° 2 (April - June 2015)
[article]
Titre : GMOBench: Benchmarking generic moving objects Type de document : Article/Communication Auteurs : Jianqiu Xu, Auteur ; Ralf Hartmut Güting, Auteur ; Xiaolin Qin, Auteur Année de publication : 2015 Article en page(s) : pp 227 - 276 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique
[Termes IGN] arbre-R
[Termes IGN] base de données orientée objet
[Termes IGN] implémentation (informatique)
[Termes IGN] index spatial
[Termes IGN] mobilité humaine
[Termes IGN] mobilité urbaine
[Termes IGN] objet mobile
[Termes IGN] point de repère
[Termes IGN] requête spatiale
[Termes IGN] test de performanceRésumé : (auteur) In real world scenarios, people’s movement include several environments rather than one, for example, road network, pavement areas and indoor. This imposes a new challenge for moving objects database that the complete trip needs to be managed by a database system. In the meantime, novel queries regarding different transportation modes should also be supported. Since existing methods are limited to trips in a single environment and do not support queries on moving objects with different transportation modes, new technologies are essentially needed in a database system. In this paper, we introduce a benchmark called GMOBench that aims to evaluate the performance of a database system managing moving objects in different environments. GMOBench is settled in a realistic scenario and is comprised of three components: (1) a data generator with the capability of creating a scalable set of trips representing the complete movement of humans (both indoor and outdoor); (2) a set of carefully designed and benchmark queries; (3) Mode-RTree, an index structure for managing generic moving objects. The generator defines some parameters so that users can control the characteristics of results. We create the benchmark data in such a way that the dataset can mirror important characteristics and real world distributions of human mobility. Efficient access methods and optimization techniques are developed for query processing. In particular, we propose an index structure called Mode-RTree to manage moving objects in different environments. By employing the proposed index, the cost of benchmark queries is greatly reduced. GMOBench is implemented in a real database system to have a practical result. We perform an extensive experimental study on comprehensive datasets to evaluate the performance. The results show that by using the Mode-RTree we achieve significant performance improvement over the baseline method, demonstrating the effectiveness and efficiency of our approaches. Numéro de notice : A2015-488 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-014-0211-9 Date de publication en ligne : 26/06/2014 En ligne : https://doi.org/10.1007/s10707-014-0211-9 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=77281
in Geoinformatica > vol 19 n° 2 (April - June 2015) . - pp 227 - 276[article]Visual overlay on OpenStreetMap data to support spatial exploration of urban environments / Chandan Kumar in ISPRS International journal of geo-information, vol 4 n°1 (March 2015)
[article]
Titre : Visual overlay on OpenStreetMap data to support spatial exploration of urban environments Type de document : Article/Communication Auteurs : Chandan Kumar, Auteur ; Wilko Heuten, Auteur ; Suzanne Boll, Auteur Année de publication : 2015 Article en page(s) : pp 87 - 104 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique web
[Termes IGN] aide à la décision
[Termes IGN] convivialité
[Termes IGN] croisement spatial
[Termes IGN] données localisées des bénévoles
[Termes IGN] entité géographique
[Termes IGN] interface web
[Termes IGN] milieu urbain
[Termes IGN] OpenStreetMap
[Termes IGN] requête spatiale
[Termes IGN] visualisation de donnéesRésumé : (auteur) Increasing volumes of spatial data about urban areas are captured and made available via volunteered geographic information (VGI) sources, such as OpenStreetMap (OSM). Hence, new opportunities arise for regional exploration that can lead to improvements in the lives of citizens through spatial decision support. We believe that the VGI data of the urban environment could be used to present a constructive overview of the regional infrastructure with the advent of web technologies. Current location-based services provide general map-based information for the end users with conventional local search functionality, and hence, the presentation of the rich urban information is limited. In this work, we analyze the OSM data to classify the geo entities into consequential categories with facilities, landscape and land use distribution. We employ a visual overlay of heat map and interactive visualizations to present the regional characterization on OSM data classification. In the proposed interface, users are allowed to express a variety of spatial queries to exemplify their geographic interests. They can compare the characterization of urban areas with respect to multiple spatial dimensions of interest and can search for the most suitable region. The search experience is further enhanced via efficient optimization and interaction methods to support the decision making of end users. We report the end user acceptability and efficiency of the proposed system via usability studies and performance analysis comparison. Numéro de notice : A2015-537 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.3390/ijgi4010087 En ligne : https://doi.org/10.3390/ijgi4010087 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=77893
in ISPRS International journal of geo-information > vol 4 n°1 (March 2015) . - pp 87 - 104[article]Efficient continuous top-k spatial keyword queries on road networks / Long Guo in Geoinformatica, vol 19 n° 1 (January - March 2015)PermalinkImproving geographic information retrieval in spatial data infrastructures / Fabio Gomes,de Andrade in Geoinformatica, vol 18 n° 4 (October 2014)PermalinkLarge-scale geo-tagged video indexing and queries / He Ma in Geoinformatica, vol 18 n° 4 (October 2014)PermalinkPermalink3D Hilbert space filling curves in 3D city modeling for faster spatial queries / Uznir Ujang in International journal of 3-D information modeling, vol 3 n° 2 (April - June 2014)PermalinkA comparative study of two approaches for supporting optimal network location queries / Parisa Ghaemi in Geoinformatica, vol 18 n° 2 (April 2014)PermalinkThe largest empty rectangle containing only a query object in Spatial Databases / Gilberto Gutiérrez in Geoinformatica, vol 18 n° 2 (April 2014)PermalinkProtecting query privacy in location-based services / Xihui Chen in Geoinformatica, vol 18 n° 1 (January 2014)PermalinkBlind evaluation of location based queries using space transformation to preserve location privacy / Ali Khshgozaran in Geoinformatica, vol 17 n° 4 (October 2013)PermalinkDecentralized querying of topological relations between regions monitored by a coordinate-free geosensor network / Myeong-Hung Jeong in Geoinformatica, vol 17 n° 4 (October 2013)Permalink