[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Miao et al., 2019 - Google Patents

On efficiently monitoring continuous aggregate k nearest neighbors in road networks

Miao et al., 2019

Document ID
1474324130311218817
Author
Miao X
Gao Y
Mai G
Chen G
Li Q
Publication year
Publication venue
IEEE Transactions on Mobile Computing

External Links

Snippet

Given a set of data objects, a set of query points, a positive integer, and an aggregate function (eg, sum, max, and min), an aggregate nearest neighbor query finds the data objects from that have the smallest aggregate distances with respect to the query points in …
Continue reading at ieeexplore.ieee.org (other versions)

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30386Retrieval requests
    • G06F17/30424Query processing
    • G06F17/30533Other types of queries
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30861Retrieval from the Internet, e.g. browsers
    • G06F17/30864Retrieval from the Internet, e.g. browsers by querying, e.g. search engines or meta-search engines, crawling techniques, push systems
    • G06F17/3087Spatially dependent indexing and retrieval, e.g. location dependent results to queries
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30312Storage and indexing structures; Management thereof
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures

Similar Documents

Publication Publication Date Title
Gidófalvi et al. Mining long, sharable patterns in trajectories of moving objects
Zhu et al. Effective and efficient trajectory outlier detection based on time-dependent popular route
Shang et al. Personalized trajectory matching in spatial networks
Wu et al. Mining spatio-temporal reachable regions over massive trajectory data
Alamri et al. A taxonomy for moving object queries in spatial databases
Yu et al. Distributed processing of k shortest path queries over dynamic road networks
Al-Baghdadi et al. Topic-based community search over spatial-social networks
Cheng et al. Distr: A distributed method for the reachability query over large uncertain graphs
Haryanto et al. Ig-tree: an efficient spatial keyword index for planning best path queries on road networks
Miao et al. On efficiently monitoring continuous aggregate k nearest neighbors in road networks
Qi et al. Efficient point-based trajectory search
Huang et al. Frequent pattern-based map-matching on low sampling rate trajectories
Huang et al. Dynamic graph mining for multi-weight multi-destination route planning with deadlines constraints
CN103345509B (en) Obtain the level partition tree method and system of the most farthest multiple neighbours on road network
KR20200086529A (en) PROCESSING METHOD OF ε-DISTANCE JOIN QUERIES IN ROAD NETWORKS AND DEVICE THAT PROCESSES ε-DISTANCE JOIN QUERIES IN ROAD NETWORKS
Ding et al. Mining spatio-temporal reachable regions with multiple sources over massive trajectory data
Ding et al. Efficient maintenance of continuous queries for trajectories
Dan et al. Double Hierarchical Labeling Shortest Distance Querying in Time-dependent Road Networks
Al-Baghdadi et al. Efficient path routing over road networks in the presence of ad-hoc obstacles
Xu et al. Continuous k nearest neighbor queries over large multi-attribute trajectories: a systematic approach
Iyer et al. Goal directed relative skyline queries in time dependent road networks
Anderson et al. Efficient MaxCount and threshold operators of moving objects
Lu et al. Trajectory splicing
Chen et al. Continuous path-based range keyword queries on road networks
Chen et al. Reverse keyword-based location search on road networks