Centre de documentation
scientifique

Snapshot and continuous points-based trajectory search / Shuyao Qi in Geoinformatica, vol 21 n° 4 (October - December 2017)  

Public [article]  inGeoinformatica > vol 21 n° 4 (October - December 2017) . - pp 669 - 701 Titre : Snapshot and continuous points-based trajectory search Type de document : Article/Communication Auteurs : Shuyao Qi, Auteur ; Dimitri Sacharidis, Auteur ; Panagiotis Bouros, Auteur ; Nikos Mamoulis, Auteur Année de publication : 2017 Article en page(s) : pp 669 - 701 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] analyse combinatoire (maths) [Termes IGN] calcul d'itinéraire [Termes IGN] distance [Termes IGN] plus proche voisin, algorithme du [Termes IGN] temps [Termes IGN] temps instantané [Termes IGN] théorie des possibilités Résumé : (Auteur) Trajectory data capture the traveling history of moving objects such as people or vehicles. With the proliferation of GPS and tracking technologies, huge volumes of trajectories are rapidly generated and collected. Under this, applications such as route recommendation and traveling behavior mining call for efficient trajectory retrieval. In this paper, we first focus on distance-to-points trajectory search; given a collection of trajectories and a set query points, the goal is to retrieve the top-k trajectories that pass as close as possible to all query points. We advance the state-of-the-art by combining existing approaches to a hybrid nearest neighbor-based method while also proposing an alternative, more efficient spatial range-based approach. Second, we investigate the continuous counterpart of distance-to-points trajectory search where the query is long-standing and the set of returned trajectories needs to be maintained whenever updates occur to the query and/or the data. Third, we propose and study two practical variants of distance-to-points trajectory search, which take into account the temporal characteristics of the searched trajectories. Through an extensive experimental analysis with real trajectory data, we show that our range-based approach outperforms previous methods by at least one order of magnitude for the snapshot and up to several times for the continuous version of the queries. Numéro de notice : A2017-600 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-016-0267-9 En ligne : https://doi.org/10.1007/s10707-016-0267-9 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=86908 [article]

Spatial inverse query processing / Thomas Bernecker in Geoinformatica, vol 17 n° 3 (July 2013)  

Public [article]  inGeoinformatica > vol 17 n° 3 (July 2013) . - pp 449 - 487 Titre : Spatial inverse query processing Type de document : Article/Communication Auteurs : Thomas Bernecker, Auteur ; Tobias Emrich, Auteur ; Hans-Peter Kriegel, Auteur ; Nikos Mamoulis, Auteur ; et al., Auteur Année de publication : 2013 Article en page(s) : pp 449 - 487 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées [Termes IGN] plus proche voisin, algorithme du [Termes IGN] requête spatiale [Termes IGN] requête spatiale inverse Résumé : (Auteur) Traditional spatial queries return, for a given query object q, all database objects that satisfy a given predicate, such as epsilon range and k-nearest neighbors. This paper defines and studies inverse spatial queries, which, given a subset of database objects Q and a query predicate, return all objects which, if used as query objects with the predicate, contain Q in their result. We first show a straightforward solution for answering inverse spatial queries for any query predicate. Then, we propose a filter-and-refinement framework that can be used to improve efficiency. We show how to apply this framework on a variety of inverse queries, using appropriate space pruning strategies. In particular, we propose solutions for inverse epsilon range queries, inverse k-nearest neighbor queries, and inverse skyline queries. Furthermore, we show how to relax the definition of inverse queries in order to ensure non-empty result sets. Our experiments show that our framework is significantly more efficient than naive approaches. Numéro de notice : A2013-382 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1007/s10707-012-0162-y Date de publication en ligne : 24/08/2012 En ligne : https://doi.org/10.1007/s10707-012-0162-y Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=32520 [article]

Exemplaires(1)

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

Retrieval of Spatial Join Pattern Instances from Sensor Networks / M.L. Yiu in Geoinformatica, vol 13 n° 1 (March 2009)  

Public [article]  inGeoinformatica > vol 13 n° 1 (March 2009) . - pp 57 - 84 Titre : Retrieval of Spatial Join Pattern Instances from Sensor Networks Type de document : Article/Communication Auteurs : M.L. Yiu, Auteur ; Nikos Mamoulis, Auteur ; S. Bakiras, Auteur Année de publication : 2009 Article en page(s) : pp 57 - 84 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées [Termes IGN] coût [Termes IGN] jointure spatiale [Termes IGN] protocole [Termes IGN] réseau de capteurs [Termes IGN] voisinage (relation topologique) Résumé : (Auteur) We study the continuous evaluation of spatial join queries and extensions thereof, defined by interesting combinations of sensor readings (events) that co-occur in a spatial neighborhood. An example of such a pattern is “a high temperature reading in the vicinity of at least four high-pressure readings”. We devise protocols for ‘in-network’ evaluation of this class of queries, aiming at the minimization of power consumption. In addition, we develop cost models that suggest the appropriateness of each protocol, based on various factors, including selectivity of query elements, energy requirements for sensing, and network topology. Finally, we experimentally compare the effectiveness of the proposed solutions on an experimental platform that emulates real sensor networks. Copyright Springer Numéro de notice : A2009-005 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE/SOCIETE NUMERIQUE Nature : Article DOI : 10.1007/s10707-007-0043-y En ligne : https://doi.org/10.1007/s10707-007-0043-y Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=29635 [article]

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
057-09011	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