Sciweavers

3514 search results - page 36 / 703
» On Moving Object Queries
Sort
View
VLDB
1994
ACM
118views Database» more  VLDB 1994»
15 years 8 months ago
Query Optimization by Predicate Move-Around
A new type of optimization, called predicate move-around, ia introduced. It is shown how this optimization `considerably improvea the efficiency of evaluating SQL queries that hav...
Alon Y. Levy, Inderpal Singh Mumick, Yehoshua Sagi...
138
Voted
SSD
2007
Springer
150views Database» more  SSD 2007»
15 years 10 months ago
Online Amnesic Summarization of Streaming Locations
Abstract. Massive data streams of positional updates become increasingly difficult to manage under limited memory resources, especially in terms of providing near real-time respons...
Michalis Potamias, Kostas Patroumpas, Timos K. Sel...
ESA
2003
Springer
58views Algorithms» more  ESA 2003»
15 years 9 months ago
Kinetic Dictionaries: How to Shoot a Moving Target
A kinetic dictionary is a data structure for storing a set S of continuously moving points on the real line, such that at any time we can quickly determine for a given query point ...
Mark de Berg
165
Voted
DEXAW
2004
IEEE
209views Database» more  DEXAW 2004»
15 years 7 months ago
Spatio-Temporal Data Warehouse Design for Human Activity Pattern Analysis
Many applications refer to moving objects or phenomena and require spatio-temporal modelling and specific analysis. Unlike conventional data where attributes are simple values (nu...
Lionel Savary, Tao Wan, Karine Zeitouni
INFSOF
2007
98views more  INFSOF 2007»
15 years 4 months ago
Indexing range sum queries in spatio-temporal databases
Although spatio-temporal databases have received considerable attention recently, there has been little work on processing range sum queries on the historical records of moving ob...
Hyung-Ju Cho, Chin-Wan Chung