Descripteur
Termes IGN > informatique > base de données > requête (informatique)
requête (informatique)Voir aussi |
Documents disponibles dans cette catégorie (223)
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
Thinking about space-time connections : spatiotemporal scheduling of individual activities / Kathleen Stewart in Transactions in GIS, vol 17 n° 6 (December 2013)
[article]
Titre : Thinking about space-time connections : spatiotemporal scheduling of individual activities Type de document : Article/Communication Auteurs : Kathleen Stewart, Auteur ; Junchuan Fan, Auteur ; Emily White, Auteur Année de publication : 2013 Article en page(s) : pp 791 - 807 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale
[Termes IGN] accessibilité
[Termes IGN] analyse spatio-temporelle
[Termes IGN] généralisation
[Termes IGN] géovisualisation
[Termes IGN] mise à jour
[Termes IGN] mobilité urbaine
[Termes IGN] modèle conceptuel de données spatio-temporelles
[Termes IGN] ontologie
[Termes IGN] personnalisation
[Termes IGN] requête spatiotemporelle
[Termes IGN] SWRLRésumé : (Auteur) This article presents a spatiotemporal model for scheduling applications that is driven by the events and activities individuals plan and manage every day. The framework is presented using an ontological approach where ontologies at different levels of generalization, e.g. domain, application, and task ontologies, are linked together through participation and inheritance relationships. S_Events are entered into a schedule as a new S_Entry, or modifications can be made to existing entries including reschedule, postpone, change location, and delete as schedules vary over time. These schedule updates are formalized through changes to planned start and end times and the planned locations of S_Entries are expressed using SWRL, a semantic web rule language. SWRL is also used for reasoning about schedule changes and the space-time conflicts that can occur. The sequence of entries in a schedule gives rise to S_trajectories representing the locations that individuals plan to visit in order to carry out their schedule, adding an additional spatial element to the framework. A prototype Geoscheduler application maps S_Entries against a timeline, offering a spatiotemporal visualization of scheduled activities showing the evolution of a schedule over space-time and affecting spatiotemporal accessibility for individuals. Numéro de notice : A2013-671 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/tgis.12028 Date de publication en ligne : 17/05/2013 En ligne : https://doi.org/10.1111/tgis.12028 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=32807
in Transactions in GIS > vol 17 n° 6 (December 2013) . - pp 791 - 807[article]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 Opportunistic sampling-based query processing in wireless sensor networks / Muhammad Umer in Geoinformatica, vol 17 n° 4 (October 2013)
[article]
Titre : Opportunistic sampling-based query processing in wireless sensor networks Type de document : Article/Communication Auteurs : Muhammad Umer, Auteur ; Egemen Tanin, Auteur ; Lars Kulik, Auteur Année de publication : 2013 Article en page(s) : pp 567 - 597 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique
[Termes IGN] modélisation spatio-temporelle
[Termes IGN] requête (informatique)
[Termes IGN] réseau de capteurs
[Termes IGN] télécommunication sans fil
[Termes IGN] transmission de donnéesRésumé : (Auteur) High resolution sampling of physical phenomenon is a prime application of large scale wireless sensor networks (WSNs). With hundreds of nodes deployed over vast tracts of land, monitoring data can now be generated at unprecedented spatio-temporal scales. However, the limited battery life of individual nodes in the network mandates smart ways of collecting this data by maximizing localized processing of information at the node level. In this paper, we propose a WSN query processing method that enhances localized information processing by harnessing the two inherent aspects of WSN communication, i.e., multihop and multipath data transmission. In an active WSN where data collection queries are regularly processed, multihop and multipath routing leads to a situation where a significant proportion of nodes relay and overhear data generated by other nodes in the network. We propose that nodes opportunistically sample this data as they communicate. We model the data communication process in a WSN and show that opportunistic sampling during data communication leads to surprisingly accurate global knowledge at each node. We present an opportunistic query processing system that uses the accumulated global knowledge to limit the data collection requirements for future queries while ensuring temporal freshness of the results. Numéro de notice : A2013-510 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/SOCIETE NUMERIQUE Nature : Article DOI : 10.1007/s10707-012-0170-y Date de publication en ligne : 05/10/2012 En ligne : https://doi.org/10.1007/s10707-012-0170-y Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=32648
in Geoinformatica > vol 17 n° 4 (October 2013) . - pp 567 - 597[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)
[article]
Titre : The k closest pairs in spatial databases: When only set is indexed Type de document : Article/Communication Auteurs : Gilberto Gutiérrez, Auteur ; Pablo Saez, Auteur Année de publication : 2013 Article en page(s) : pp 543 - 565 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] extensibilité
[Termes IGN] rectangle englobant minimum
[Termes IGN] requête spatialeRésumé : (Auteur) We provide in this article a branch-and-bound algorithm that solves the problem of finding the k closest pairs of points (p,q), p € P,q € Q, considering two sets of points in the euclidean plane P,Q stored in external memory assuming that only one of the sets has a spatial index. This problem arises naturally in many scenarios, for instance when the set without an index is the answer to a spatial query. The main idea of our algorithm is to partition the space occupied by the set without an index into several cells or subspaces and to make use of the properties of a set of metrics defined on two Minimum Bounding Rectangles (MBRs). We evaluated our algorithm for different values of k by means of a series of experiments that considered both synthetical and real world datasets. We compared the performance of our algorithm with that of techniques that either assume that both datasets have a spatial index or that none has an index. The results show that our algorithm needs only between a 0.3 and a 35 % of the disk accesses required by such techniques. Our algorithm also shows a good scalability, both in terms of k and of the size of the data set. Numéro de notice : A2013-509 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1007/s10707-012-0169-4 Date de publication en ligne : 14/09/2012 En ligne : https://doi.org/10.1007/s10707-012-0169-4 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=32647
in Geoinformatica > vol 17 n° 4 (October 2013) . - pp 543 - 565[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 Index-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)PermalinkParallel indexing technique for spatio-temporal data / Zhenwen He in ISPRS Journal of photogrammetry and remote sensing, vol 78 (April 2013)PermalinkContinuous aggregate nearest neighbor queries / H. Elmongui in Geoinformatica, vol 17 n° 1 (January 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)PermalinkUne approche ontologique pour la structuration de données spatio-temporelles de trajectoires : Application à l’étude des déplacements de mammifères marins / W. Mefteh in Revue internationale de géomatique, vol 22 n° 1 (mars - mai 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 data model and query language for spatio-temporal decision support / L. Gomez in Geoinformatica, vol 15 n° 3 (July 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)PermalinkPermalinkThe 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)PermalinkApproche géosémantique intégrée pour les cubes évolutifs de données géospatiales / Mohamed Bakillah in Revue internationale de géomatique, vol 21 n° 1 (mars – mai 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)Permalink