Filters








3,965 Hits in 6.9 sec

Advanced String Search over Spatial Databases

Vara Lakshmi Konagala, V. Sujatha
2014 International Journal of Private Cloud Computing Environment and Management  
Similarly, extends SAS queries to road networks (referred as RSAS queries) [5] .  ...  We introduce a new index for answering ESAS queries efficiently those methods can be embedded from original data and then converts evaluating set resemblance using min-wise signatures.  ...  In this work, we focus on range queries in road networks known as spatial approximate string (SAS) queries in road networks (RSAS queries) [5] .Spatial range queries inquire about certain spatial objects  ... 
doi:10.21742/ijpccem.2014.1.1.02 fatcat:32evpcb2bbgtrbpwbohnn7ebua

Query Processing Using Distance Oracles for Spatial Networks

Jagan Sankaranarayanan, Hanan Samet
2010 IEEE Transactions on Knowledge and Data Engineering  
Initially, an "-approximate distance oracle of size Oð n " d Þ is used that is capable of retrieving the approximate network distance in Oðlog nÞ time using a B-tree.  ...  The fact that the network distance can be approximated by one value is used to show how a number of spatial queries can be formulated using appropriate SQL constructs and a few built-in primitives.  ...  ACKNOWLEDGMENTS The authors have been benefited greatly from discussions with Houman Alborzi.  ... 
doi:10.1109/tkde.2010.75 fatcat:cdmtftqhxnbarpb7wof7jz7cay

Distance Indexing on Road Networks

Haibo Hu, Dik Lun Lee, Victor C. S. Lee
2006 Very Large Data Bases Conference  
However, there is a lack of systematic study on the computation of network distances, which is the most fundamental difference between a road network and a Euclidean space.  ...  By mathematical analysis and experimental study, we showed that the signature index is efficient and robust for various data distributions, query workloads, parameter settings and network updates.  ...  ACKNOWLEDGMENTS The authors would like to thank the anonymous reviewers for their insightful comments and helpful suggestions for our preparation of this manuscript.  ... 
dblp:conf/vldb/HuLL06 fatcat:eribc3e4ojgy5ehvdinsz7l4ji

Analytical queries on road networks

Shangfu Peng, Hanan Samet
2015 Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems - GIS '15  
The second architecture uses of a distance oracle representation of a road network.  ...  Spatial analytical queries on road networks typically perform hundreds of thousands to several millions of shortest distance computations in the process of producing results.  ...  Since the spatial analytical queries are an important use-case whose efficiency depends on being able to compute millions of network distance computations efficiently on road networks, there is a need  ... 
doi:10.1145/2820783.2820806 dblp:conf/gis/PengS15 fatcat:gfiz343s4ffgzbkhnhrgwvaipa

Keyword Search on Large Graphs: A Survey

Jianye Yang, Wu Yao, Wenjie Zhang
2021 Data Science and Engineering  
Essentially, given a graph G and query Q associated with a set of keywords, the keyword search aims to find a substructure (e.g., rooted tree or subgraph) S in G such that nodes in S collectively cover  ...  AbstractWith the prevalence of Internet access and online services, various big graphs are generated in many real applications (e.g., online social networks and knowledge graphs).  ...  Spatial Keyword Query on Road Networks • Diversified spatial keyword search. Zhang et al. [102] study the problem of diversified spatial keyword search on road networks.  ... 
doi:10.1007/s41019-021-00154-4 fatcat:qo5ikgtj2zhetbhenljyujxbli

Distance Oracles for Spatial Networks

Jagan Sankaranarayanan, Hanan Samet
2009 Proceedings / International Conference on Data Engineering  
Initially, use is made of an εapproximate distance oracle of size O( n ε d ) that is capable of retrieving the approximate network distance in O(log n) time using a B-tree.  ...  The network distance between every pair of vertices in the spatial network is efficiently represented by adapting the well-separated pair technique to spatial networks.  ...  Acknowledgments: We have benefited greatly from discussions with Houman Alborzi.  ... 
doi:10.1109/icde.2009.53 dblp:conf/icde/SankaranarayananS09 fatcat:ivqlncyve5glfhucnr6rg2fksq

Efficient query processing on spatial networks

Jagan Sankaranarayanan, Houman Alborzi, Hanan Samet
2005 Proceedings of the 2005 international workshop on Geographic information systems - GIS '05  
Using this framework, a wide variety of spatial queries such as incremental nearest neighbor searches and spatial distance joins can be shown to work on datasets of locations residing on a spatial network  ...  A road network is an example of a spatial network.  ...  The first contribution of our work is a novel framework that allows efficient processing of spatial queries on spatial networks.  ... 
doi:10.1145/1097064.1097093 dblp:conf/gis/SankaranarayananAS05 fatcat:d5zy3dhvyzemnjxvfvmxatugri

Trajectory Indexing Using Movement Constraints*

Dieter Pfoser, Christian S. Jensen
2005 Geoinformatica  
When faced with a new type of data such as the movements of network-constrained objects, how to efficiently process queries against these data is an important challenge.  ...  As in spatial databases, a query is processed using, first, an index on a "reduced" dataset, which yields a result with perfect  ...  Acknowledgements The authors would like to thank Thomas Brinkhoff for providing us with the use of his network-based data generator as well as for being ever-present with help and support.  ... 
doi:10.1007/s10707-005-6429-9 fatcat:ew2jl5vmmvhcpdvpeap32p4fr4

Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme

Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
2014 IEEE Transactions on Knowledge and Data Engineering  
Our experimental results on large-scale social networks and road networks demonstrate that the local landmark scheme reduces the shortest distance estimation error significantly when compared with global  ...  Furthermore, the challenge of immense graphs whose index may not fit in the memory leads us to store the embedding in relational database, so that a query of the local landmark scheme can be expressed  ...  For example, in a US road network with 24 million nodes and 58 million edges, landmark embedding (with 50 randomly selected landmarks) has a maximum relative error of 68 for one query among 10, 000 random  ... 
doi:10.1109/tkde.2012.253 fatcat:msdm5edmnnaqrli5vh6my4txsm

Roads, codes, and spatiotemporal queries

Sandeep Gupta, Swastik Kopparty, Chinya Ravishankar
2004 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '04  
The coding method also efficiently captures many properties of the network relevant to spatial and spatiotemporal queries.  ...  We present a novel coding-based technique for answering spatial and spatiotemporal queries on objects moving along a system of curves on the plane such as many road networks.  ...  In Section 6 we describe how our scheme can be used to answer a vast range of spatial and spatiotemporal queries on road networks efficiently.  ... 
doi:10.1145/1055558.1055576 dblp:conf/pods/GuptaKR04 fatcat:mjkly7pptfdahouu5wvmpt6yke

PARINET: A tunable access method for in-network trajectories

Iulian Sandu Popa, Karine Zeitouni, Vincent Oria, Dominique Barth, Sandrine Vial
2010 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)  
Because the network can be modeled using graphs, the partitioning of the trajectory data is based on graph partitioning theory and can be tuned for a given query load.  ...  The data in each partition is indexed on the time component using B + -trees. We study different types of queries, and provide an optimal configuration for several scenarios.  ...  We also thank the authors of [1] for giving their permission to use Figure 1 .  ... 
doi:10.1109/icde.2010.5447885 dblp:conf/icde/PopaZOBV10 fatcat:dji552p4v5g55h7prxzef5ib7m

A Novel Representation and Compression for Queries on Trajectories in Road Networks

Xiaochun Yang, Bin Wang, Kai Yang, Chengfei Liu, Baihua Zheng
2018 IEEE Transactions on Knowledge and Data Engineering  
In this paper, we explore several characteristics of the trajectories in road networks, which have motivated the idea of coding trajectories by associating timestamps with relative spatial path and locations  ...  We demonstrate the advantage of our method and compare it against existing ones through a thorough experimental study on real trajectories in road network.  ...  A raw trajectory can be embeded to an embedded trajectory in a road network using map matching process [20] , with each time-stamped raw positional data p mapped to anembed data.  ... 
doi:10.1109/tkde.2017.2776927 fatcat:2vgtoxipirehfelnlmbp5fczn4

Spatial Query Localization Method In Limited Reference Point Environment

Victor Krebss
2013 Zenodo  
We propose simple embedding algorithm and sample implementation as spatial queries over sensor network data stored in spatial database, allowing employing effectively spatial indexing, optimized spatial  ...  New opportunities arise for the localization due to the rapidly emerging concept of a wireless ad-hoc network.  ...  Although spatial queries have been extensively studied, to the best of our knowledge, there exists no previous work that studies distance graph matching with map regions.  ... 
doi:10.5281/zenodo.1074278 fatcat:cunbivwsu5ffvggicsso2uyt5u

Efficient Exact k-Flexible Aggregate Nearest Neighbor Search in Road Networks Using the M-tree [article]

Moonyoung Chung, Soon J. Hyun, Woong-Kee Loh
2021 arXiv   pre-print
This study proposes an efficient exact k-flexible aggregate nearest neighbor (k-FANN) search algorithm in road networks using the M-tree.  ...  The state-of-the-art IER-kNN algorithm used the R-tree and pruned off unnecessary nodes based on the Euclidean coordinates of objects in road networks.  ...  [17] presented an approximate k-NN algorithm using Road Network Embedding (RNE), which maps objects on a road network to a p-dimensional Euclidean space.  ... 
arXiv:2106.05620v2 fatcat:endfmrfhpve2pjoebu5goivu6u

Spatial Approximate String Search

Feifei Li, Bin Yao, Mingwang Tang, Marios Hadjieleftheriou
2013 IEEE Transactions on Knowledge and Data Engineering  
Specifically, we investigate range queries augmented with a string similarity search predicate in both Euclidean space and road networks. We dub this query the spatial approximate string (SAS) query.  ...  This work deals with the approximate string search in large spatial databases.  ...  In the context of spatial databases, approximate string search could be combined with any type of spatial queries.  ... 
doi:10.1109/tkde.2012.48 fatcat:43ee5uizfvbczjmspj66j4pbq4
« Previous Showing results 1 — 15 out of 3,965 results