Descripteur
Termes IGN > informatique > base de données > requête (informatique) > requête spatiale
requête spatiale |
Documents disponibles dans cette catégorie (156)
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
A comparative study of two approaches for supporting optimal network location queries / Parisa Ghaemi in Geoinformatica, vol 18 n° 2 (April 2014)
[article]
Titre : A comparative study of two approaches for supporting optimal network location queries Type de document : Article/Communication Auteurs : Parisa Ghaemi, Auteur ; Kaveh Shahabi, Auteur ; John P. Wilson, Auteur ; Farnoush Banaei-Kashani, Auteur Année de publication : 2014 Article en page(s) : pp 229 - 251 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique
[Termes IGN] analyse comparative
[Termes IGN] base de données spatiotemporelles
[Termes IGN] distance
[Termes IGN] étude d'implantation
[Termes IGN] géomercatique
[Termes IGN] optimisation (mathématiques)
[Termes IGN] requête spatiale
[Termes IGN] réseau routierRésumé : (Auteur) Given a set S of sites and a set O of weighted objects, an optimal location query finds the location(s) where introducing a new site maximizes the total weight of the objects that are closer to the new site than to any other site. With such a query, for instance, a franchise corporation (e.g., McDonald’s) can find a location to open a new store such that the number of potential store customers (i.e., people living close to the store) is maximized. Optimal location queries are computationally complex to compute and require efficient solutions that scale with large datasets. Previously, two specific approaches have been proposed for efficient computation of optimal location queries. However, they both assume p-norm distance (namely, L1 and L2/Euclidean); hence, they are not applicable where sites and objects are located on spatial networks. In this article, we focus on optimal network location (ONL) queries, i.e., optimal location queries in which objects and sites reside on a spatial network. We introduce two complementary approaches, namely EONL (short for Expansion-based ONL) and BONL (short for Bound-based ONL), which enable efficient computation of ONL queries with datasets of uniform and skewed distributions, respectively. Moreover, with an extensive experimental study, we verify and compare the efficiency of our proposed approaches with real world datasets, and we demonstrate the importance of considering network distance (rather than p-norm distance) with ONL queries. Numéro de notice : A2014-225 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-013-0179-x Date de publication en ligne : 28/04/2013 En ligne : https://doi.org/10.1007/s10707-013-0179-x Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=33128
in Geoinformatica > vol 18 n° 2 (April 2014) . - pp 229 - 251[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 057-2014021 RAB Revue Centre de documentation En réserve L003 Disponible The largest empty rectangle containing only a query object in Spatial Databases / Gilberto Gutiérrez in Geoinformatica, vol 18 n° 2 (April 2014)
[article]
Titre : The largest empty rectangle containing only a query object in Spatial Databases Type de document : Article/Communication Auteurs : Gilberto Gutiérrez, Auteur ; José R. Paramá, Auteur ; Nieves Brisaboa, Auteur ; Antonio Corral, Auteur Année de publication : 2014 Article en page(s) : pp 193 - 228 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] base de données localisées
[Termes IGN] classification automatique d'objets
[Termes IGN] indexation spatiale
[Termes IGN] requête spatiale
[Termes IGN] traitement automatique de donnéesRésumé : (Auteur) Let S be a set of n points in a fixed axis-parallel rectangle R Í R2 , i.e. in the two-dimensional space (2D). Assuming that those points are stored in an R-tree, this paper presents several algorithms for finding the empty rectangle in R with the largest area, sides parallel to the axes of the space, and containing only a query point q. This point can not be part of S, that is, it is not stored in the R-tree. All algorithms follow the basic idea of discarding part of the points of S, in such a way that the problem can be solved only considering the remaining points. As a consequence, the algorithms only have to access a very small portion of the nodes (disk blocks) of the R-tree, saving main memory resources and computation time. We provide formal proofs of the correctness of our algorithms and, in order to evaluate the performance of the algorithms, we run an extensive set of experiments using synthetic and real data. The results have demonstrated the efficiency and scalability of our algorithms for different dataset configurations. Numéro de notice : A2014-224 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1007/s10707-013-0178-y Date de publication en ligne : 19/04/2013 En ligne : https://doi.org/10.1007/s10707-013-0178-y Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=33127
in Geoinformatica > vol 18 n° 2 (April 2014) . - pp 193 - 228[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 057-2014021 RAB Revue Centre de documentation En réserve L003 Disponible Protecting query privacy in location-based services / Xihui Chen in Geoinformatica, vol 18 n° 1 (January 2014)
[article]
Titre : Protecting query privacy in location-based services Type de document : Article/Communication Auteurs : Xihui Chen, Auteur ; Jun Pang, Auteur Année de publication : 2014 Article en page(s) : pp 95 - 133 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Société de l'information
[Termes IGN] métrique
[Termes IGN] protection de la vie privée
[Termes IGN] requête spatiale
[Termes IGN] service fondé sur la positionRésumé : (Auteur) The popularity of location-based services (LBSs) leads to severe concerns on users’ privacy. With the fast growth of Internet applications such as online social networks, more user information becomes available to the attackers, which allows them to construct new contextual information. This gives rise to new challenges for user privacy protection and often requires improvements on the existing privacy-preserving methods. In this paper, we classify contextual information related to LBS query privacy and focus on two types of contexts—user profiles and query dependency: user profiles have not been deeply studied in LBS query privacy protection, while we are the first to show the impact of query dependency on users’ query privacy. More specifically, we present a general framework to enable the attackers to compute a distribution on users with respect to issuing an observed request. The framework can model attackers with different contextual information. We take user profiles and query dependency as examples to illustrate the implementation of the framework and their impact on users’ query privacy. Our framework subsequently allows us to show the insufficiency of existing query privacy metrics, e.g., k-anonymity, and propose several new metrics. In the end, we develop new generalisation algorithms to compute regions satisfying users’ privacy requirements expressed in these metrics. By experiments, our metrics and algorithms are shown to be effective and efficient for practical usage. Numéro de notice : A2014-029 Affiliation des auteurs : non IGN Thématique : SOCIETE NUMERIQUE Nature : Article DOI : 10.1007/s10707-013-0192-0 Date de publication en ligne : 18/10/2013 En ligne : https://doi.org/10.1007/s10707-013-0192-0 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=32934
in Geoinformatica > vol 18 n° 1 (January 2014) . - pp 95 - 133[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 057-2014011 RAB Revue Centre de documentation En réserve L003 Disponible Blind evaluation of location based queries using space transformation to preserve location privacy / Ali Khshgozaran in Geoinformatica, vol 17 n° 4 (October 2013)
[article]
Titre : Blind evaluation of location based queries using space transformation to preserve location privacy Type de document : Article/Communication Auteurs : Ali Khshgozaran, Auteur ; Houtan Shirani-Mehr, Auteur ; Cyrus Shahabi, Auteur Année de publication : 2013 Article en page(s) : pp 599 - 634 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale
[Termes IGN] espace de Hilbert
[Termes IGN] géopositionnement
[Termes IGN] plus proche voisin, algorithme du
[Termes IGN] protection de la vie privée
[Termes IGN] requête spatiale
[Termes IGN] service fondé sur la position
[Termes IGN] utilisateurRésumé : (Auteur) In this paper, we propose a fundamental approach to perform the class of Range and Nearest Neighbor (NN) queries, the core class of spatial queries used in location-based services, without revealing any location information about the query in order to preserve users’ private location information. The idea behind our approach is to utilize the power of one-way transformations to map the space of all objects and queries to another space and resolve spatial queries blindly in the transformed space. Traditional encryption based techniques, solutions based on the theory of private information retrieval, or the recently proposed anonymity and cloaking based approaches cannot provide stringent privacy guarantees without incurring costly computation and/or communication overhead. In contrast, we propose efficient algorithms to evaluate KNN and range queries privately in the Hilbert transformed space. We also propose a dual curve query resolution technique which further reduces the costs of performing range and KNN queries using a single Hilbert curve. We experimentally evaluate the performance of our proposed range and KNN query processing techniques and verify the strong level of privacy achieved with acceptable computation and communication overhead. Numéro de notice : A2013-511 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-012-0172-9 Date de publication en ligne : 29/11/2012 En ligne : https://doi.org/10.1007/s10707-012-0172-9 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=32649
in Geoinformatica > vol 17 n° 4 (October 2013) . - pp 599 - 634[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 057-2013041 RAB Revue Centre de documentation En réserve L003 Disponible Decentralized querying of topological relations between regions monitored by a coordinate-free geosensor network / Myeong-Hung Jeong in Geoinformatica, vol 17 n° 4 (October 2013)
[article]
Titre : Decentralized querying of topological relations between regions monitored by a coordinate-free geosensor network Type de document : Article/Communication Auteurs : Myeong-Hung Jeong, Auteur ; Matt Duckham, Auteur Année de publication : 2013 Article en page(s) : pp 669 - 696 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique
[Termes IGN] format SVG
[Termes IGN] intersection spatiale
[Termes IGN] relation topologique
[Termes IGN] requête spatiale
[Termes IGN] réseau de capteursRésumé : (Auteur) Geosensor networks present unique resource constraints to spatial computation, including limited battery power, communication constraints, and frequently a lack of coordinate positioning systems. As a result, there is a need for new algorithms that can efficiently satisfy basic spatial queries within those resource constraints. This paper explores the design and evaluation of a family of new algorithms for determining the topological relations between regions monitored by such a resource-constrained geosensor network. The algorithms are based on efficient, decentralized (in-network) variants of conventional 4-intersection and intersection and difference models, with in-network data aggregation. Further, our algorithms operate without any coordinate information, making them suitable applications where a positioning system is unavailable or unreliable. While all four algorithms are shown to have overall communication complexity O(n) and optimal load balance O(1), the algorithms differ in the level of topological detail they can detect; the types of regions they can monitor; and in the constant factors for communication complexity. The paper also demonstrates the impact of finite granularity observations on the correctness of the query results. In the conclusions, we identify the need to conduct further fundamental research on the relationship between topological relations between regions and limited granularity sensor observations of those regions. Numéro de notice : A2013-513 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/SOCIETE NUMERIQUE Nature : Article DOI : 10.1007/s10707-012-0172-9 Date de publication en ligne : 03/02/2013 En ligne : https://doi.org/10.1007/s10707-012-0172-9 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=32650
in Geoinformatica > vol 17 n° 4 (October 2013) . - pp 669 - 696[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 057-2013041 RAB Revue Centre de documentation En réserve L003 Disponible The k closest pairs in spatial databases: When only set is indexed / Gilberto Gutiérrez in Geoinformatica, vol 17 n° 4 (October 2013)PermalinkIndex-based query processing on distributed multidimensional data / George Tsatsanifos in Geoinformatica, vol 17 n° 3 (July 2013)PermalinkPermalinkModèle pour un serveur de données géographiques. Les services web géographiques WMS et WFS / Nissrine Souissi in Revue internationale de géomatique, vol 23 n° 2 (juin - aout 2013)PermalinkPerception-based shape retrieval for 3D building models / M. Zhang in ISPRS Journal of photogrammetry and remote sensing, vol 75 (January 2013)PermalinkA review of EO image information mining / M. Quartilly in ISPRS Journal of photogrammetry and remote sensing, vol 75 (January 2013)PermalinkSemisupervised classification of remote sensing images with active queries / Jordi Munoz-Mari in IEEE Transactions on geoscience and remote sensing, vol 50 n° 10 Tome 1 (October 2012)PermalinkTopological operators: a relaxed query processing approach / Alberto Belussi in Geoinformatica, vol 16 n° 1 (January 2012)PermalinkPostGIS pour les néophytes (6ème partie) : Le langage PL/PgSQL / Anonyme in Géomatique expert, n° 82 (01/09/2011)PermalinkA new GIScience application for visualized natural resources management and decision support / Y. Yang in Transactions in GIS, vol 15 supplement s1 (July 2011)PermalinkQuery-aware location anonymization for road networks / C. Chow in Geoinformatica, vol 15 n° 3 (July 2011)PermalinkThe partial sequenced route query with traveling rules in road networks / H. Chen in Geoinformatica, vol 15 n° 3 (July 2011)PermalinkCartoMundi, collectio chartarum orbe terrae / Jean-Luc Arnaud in Géomatique expert, n° 80 (01/05/2011)PermalinkCollaborative web-GIS design: a case study for road risk analysis and monitoring / Francesco Pirotti in Transactions in GIS, vol 15 n° 2 (April 2011)PermalinkPostGIS pour les néophytes (3ème partie) : Géométries, création de tables et opérateurs élémentaires / Anonyme in Géomatique expert, n° 79 (01/03/2011)PermalinkAnalyse spatiale de l'information géographique / R. Caloz (2011)PermalinkFunctional description of geoprocessing services as conjunctive datalog queries / D. Fitzner in Geoinformatica, vol 15 n° 1 (January 2011)PermalinkIRSJ : incremental refining spatial joins for interactive queries in GIS / W. Bae in Geoinformatica, vol 14 n° 4 (October 2010)PermalinkExploiting geographic references of documents in a geographical information retrieval system using an ontology-based index / N. Brisaboa in Geoinformatica, vol 14 n° 3 (July 2010)PermalinkA knowledge infrastructure for intelligent query answering in Location-based Services / S Yu in Geoinformatica, vol 14 n° 3 (July 2010)Permalink