Analysis of predictive spatio-temporal queries

No abstract is available for this paper.

• Publication year

  2003

• Venue

  TODS

• Publication date

  2003-12-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/958942.958943
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• ACM Transactions on Database Systems

  2005cited by this paper
• Spatial queries in dynamic environments

  2003cited by this paper
• The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries

  2003cited by this paper
• Indexing Moving Points

  2003cited by this paper
• Performance evaluation of spatio-temporal selectivity estimation techniques

  2003cited by this paper
• Selectivity estimation for predictive spatio-temporal queries

  2003cited by this paper
• Efficient Indexing of Spatiotemporal Objects

  2002cited by this paper
• Numerical recipes in C

  2002cited by this paper
• Nearest neighbor and reverse nearest neighbor queries for moving objects

  2002cited by this paper
• Exploring spatial datasets with histograms

  2002cited by this paper
• Dynamic multidimensional histograms

  2002cited by this paper
• A Framework for Generating Network-Based Moving Objects

  2002cited by this paper
• Selectivity Estimation for Spatial Joins with Geometric Selections

  2002cited by this paper
• Selectivity estimation for spatio-temporal queries to moving objects

  2002cited by this paper
• Indexing of moving objects for location-based services

  2002cited by this paper
• Time-parameterized queries in spatio-temporal databases

  2002cited by this paper
• Independence is good: dependency-based histogram synopses for high-dimensional data

  2001cited by this paper
• STHoles: a multidimensional workload-aware histogram

  2001cited by this paper
• Multiway spatial joins

  2001cited by this paper
• Overcoming limitations of sampling for aggregation queries

  2001cited by this paper
• Applying the golden rule of sampling for query estimation

  2001cited by this paper
• On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces

  2001cited by this paper
• Accurate Modeling of Region Data

  2001cited by this paper
• Selectivity estimation for spatial joins

  2001cited by this paper
• Accurate estimation of the cost of spatial selections

  2000cited by this paper
• Novel Approaches to the Indexing of Moving Object Trajectories

  2000cited by this paper
• Efficient Cost Models for Spatial Queries Using R-Trees

  2000cited by this paper
• A cost model for query processing in high dimensional data spaces

  2000cited by this paper
• Dynamic Maintenance of Wavelet-Based Histograms

  2000cited by this paper
• Indexing moving points (extended abstract)

  2000cited by this paper
• Indexing the positions of continuously moving objects

  2000cited by this paper
• Approximating multi-dimensional aggregate range queries over real attributes

  2000influential reference
• Density biased sampling: an improved method for data mining and clustering

  2000cited by this paper
• Analyzing range queries on spatial data

  2000cited by this paper
• Spatial join selectivity using power laws

  2000cited by this paper
• Closest pair queries in spatial databases

  2000cited by this paper
• Novel Approaches in Query Processing for Moving Object Trajectories

  2000cited by this paper
• Computational Geometry: Algorithms and Applications, Second Edition

  2000cited by this paper
• Multi-dimensional selectivity estimation using compressed histogram information

  1999cited by this paper
• On the Generation of Spatiotemporal Datasets

  1999cited by this paper
• Selectivity estimation in spatial databases

  1999cited by this paper
• A comparison of selectivity estimators for range queries on metric attributes

  1999cited by this paper
• On indexing mobile objects

  1999cited by this paper
• Distance browsing in spatial databases

  1999cited by this paper
• When Is ''Nearest Neighbor'' Meaningful?

  1999cited by this paper
• A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces

  1998cited by this paper
• Wavelet-based histograms for selectivity estimation

  1998cited by this paper
• Selectivity estimation of Window queries for line segment datasets

  1998cited by this paper
• Cost models for join queries in spatial databases

  1998cited by this paper
• A cost model for similarity queries in metric spaces

  1998cited by this paper
• Self-spacial join selectivity estimation using fractal concepts

  1998cited by this paper
• A cost model for estimating the performance of spatial joins using R-trees

  1997cited by this paper
• Selectivity Estimation Without the Attribute Value Independence Assumption

  1997cited by this paper
• Computational geometry: algorithms and applications

  1997influential reference
• Performance of Nearest Neighbor Queries in R-Trees

  1997cited by this paper
• A cost model for nearest neighbor search in high-dimensional data space

  1997cited by this paper
• Nearest neighbor queries

  1995cited by this paper
• Estimating the Selectivity of Spatial Queries Using the 'Correlation' Fractal Dimension

  1995influential reference
• A Cost Model for Query Optimization Using R-Trees

  1994cited by this paper
• Towards an analysis of range query performance in spatial data structures

  1993cited by this paper
• On packing R-trees

  1993cited by this paper
• Random Sampling from Database Files: A Survey

  1990cited by this paper
• The R*-tree: an efficient and robust access method for points and rectangles

  1990influential reference
• Equi-depth multidimensional histograms

  1988cited by this paper
• Exponential smoothing: The state of the art

  1985cited by this paper
• R-trees: a dynamic index structure for spatial searching

  1984influential reference

• $DeepMotions$ : A Deep Learning System for Path Prediction Using Similar Motions

  2020cites this paper
• Spatiotemporal Selectivity Estimation

  2018cites this paper
• Panda∗: A generic and scalable framework for predictive spatio-temporal queries

  2017cites this paper
• Spatial Predictive Query Processing on Euclidean Space

  2017cites this paper
• Interpolating the Missing Values for Multi-Dimensional Spatial-Temporal Sensor Data: A Tensor SVD Approach

  2017cites this paper
• Private and Scalable Execution of SQL Aggregates on a Secure Decentralized Architecture

  2016cites this paper
• Predictive Spatio-Temporal Query Processor on Resilient Distributed Datasets

  2016cites this paper
• Scalable Spatial Predictive Query Processing for Moving Objects

  2015cites this paper
• Studies on Depth-First Mining Algorithms for Maximal Flock Patterns from Large Trajectory Data

  2015cites this paper
• Spatial Predictive Queries

  2015cites this paper
• Computing Spatial Distance Histograms for Large Scientific Data Sets On-the-Fly

  2014cites this paper
• Mobility Database Management

  2014cites this paper
• Efficient and Private Processing of Analytical Queries in Scientific Datasets

  2013cites this paper
• Partitioned-Tree Nested Loop Join: An Efficient Join for Spatio-Temporal Interval Join

  2013cites this paper
• Crowdsourced Trace Similarity with Smartphones

  2013cites this paper
• Flexible Pattern Queries

  2013cites this paper
• Modeling Visit Potential of Geographic Locations Based on Mobility Data

  2012cites this paper
• Distance histogram computation based on spatiotemporal uniformity in scientific data

  2012cites this paper
• Predictive spatio-temporal queries: a comprehensive survey and future directions

  2012cites this paper
• Panda: a predictive spatio-temporal query processor

  2012cites this paper
• Modeling Visit Potential of Geographic Locations Based on Mobility Data

  2012cites this paper
• Indexing and search on complex data warehouses and rapidly-changing data

  2012cites this paper
• Moving Object Query Processing Technique for Recommendation Service

  2012cites this paper
• Trajectory Pattern Mining

  2011cites this paper
• Disclosure-Free GPS Trace Search in Smartphone Networks

  2011cites this paper
• Performance analysis of a dual-tree algorithm for computing spatial distance histograms

  2011cites this paper
• Geospatial presentation of purchase transactions data

  2011cites this paper
• MOVIES: indexing moving objects by shooting index images

  2011cites this paper
• Optimized algorithms for predictive range and KNN queries on moving objects

  2010cites this paper
• An application of Cyclic Signature (CS) clustering for spatial-temporal pattern analysis to support public safety work

  2010cites this paper
• Location-dependent query processing: Where we are and where we are heading

  2010influential citation
• Safety and Domain Independence

  2009cites this paper
• Performance analysis of a binary-tree-based algorithm for computing Spatial Distance Histograms

  2009cites this paper
• Workshop co-chairs

  2009cites this paper
• Casper*: Query processing for location services without compromising privacy

  2009cites this paper
• DynSketch: a spatio-temporal aggregate index for moving objects in road networks

  2009cites this paper
• Spatio-Temporal Selectivity Estimation

  2009cites this paper
• Cost-Based Predictive Spatiotemporal Join

  2009cites this paper
• Top-k Retrieval Techniques in Distributed Sensor Systems

  2008cites this paper
• Indexing Spatio-temporal Archives

  2008cites this paper
• Spatiotemporal Data Mining

  2008cites this paper
• Primal or dual: which promises faster spatiotemporal search?

  2008cites this paper
• On the Complexity of Recursive Tree-Based Algorithms for Computing Distance Histograms

  2008cites this paper
• Predictive Indexing for Position Data of Moving Objects in the Real World

  2008influential citation
• Computing Spatial Distance Histograms Efficiently in Scientific Databases

  2008cites this paper
• The Bdual-Tree: indexing moving objects by space filling curves in the dual space

  2008cites this paper
• Modelling and querying sensor databases

  2007cites this paper
• Algorithms for Nearest Neighbor Search on Moving Object Trajectories

  2007cites this paper
• Index-based Most Similar Trajectory Search

  2007cites this paper
• The Concentration of Fractional Distances

  2007cites this paper
• Video-Data Knowledge Modelling & Discovery

  2007cites this paper
• Modelling and querying sensor databases

  2007cites this paper
• An Efficient Query Processing Data Structure for Moving Objects using Information of Future Positions

  2007cites this paper
• A Probabilistic Model Based Predictive Spatio-Temporal Range Query Processing

  2007cites this paper
• Indexing spatiotemporal archives

  2006cites this paper
• Spatio-temporal join selectivity

  2006cites this paper
• The new Casper: query processing for location services without compromising privacy

  2006cites this paper
• Developing a dynamic query system on location-based services

  2006influential citation
• A Complete Bibliography of ACM Transactions on Database Systems

  2006cites this paper
• Distributed spatio-temporal similarity search

  2006cites this paper
• Venn sampling: a novel prediction technique for moving objects

  2005cites this paper
• Scalable continuous query processing in location-aware database servers

  2005cites this paper
• Nearest Neighbor Search on Moving Object Trajectories

  2005cites this paper
• Continuous Query Processing of Spatio-Temporal Data Streams in PLACE

  2005cites this paper
• Historical spatio-temporal aggregation

  2005cites this paper
• Continuous Query Processing in Spatio-Temporal Databases

  2004cites this paper
• Continuous Query Processing of Spatio-temporal Data Streams in Place *

  2004cites this paper
• Continuous Query Processing of Spatio-temporal Data Streams in Place

  2004cites this paper
• Spatio-temporal aggregation using sketches

  2004cites this paper
• Recent progress on selected topics in database research — A report by nine young Chinese researchers working in the United States

  2003cites this paper
• Indexing and search on complex data warehouses and rapidly-changing data

  year unknowncites this paper