© Christian S. Jensen - CAMM workshop, Providence, RI, January 24-25, 2002 Data Representation and Indexing in Location-Enabled M-Services Christian S.

Slides:



Advertisements
Similar presentations
Danzhou Liu Ee-Peng Lim Wee-Keong Ng
Advertisements

May 7, A Real Problem  What if you wanted to run a program that needs more memory than you have?
Yoshiharu Ishikawa (Nagoya University) Yoji Machida (University of Tsukuba) Hiroyuki Kitagawa (University of Tsukuba) A Dynamic Mobility Histogram Construction.
1 A Real Problem  What if you wanted to run a program that needs more memory than you have?
Mining Time Series.
Indexing the imprecise positions of moving objects Xiaofeng Ding and Yansheng Lu Department of Computer Science Huazhong University of Science & Technology.
Effectively Indexing Uncertain Moving Objects for Predictive Queries School of Computing National University of Singapore Department of Computer Science.
Opportunistic Resource Exchange in Inter-vehicle Ad-hoc Networks Δημόκας Νικόλαος Data Engineering Laboratory, Aristotle University of Thessaloniki.
Indexing the Positions of Continuously Moving Objects Saltenis, Jensen, Leutenegger and Lopez.
Database Management Systems, R. Ramakrishnan and J. Gehrke1 Query Evaluation Chapter 11 External Sorting.
--Presented By Sudheer Chelluboina. Professor: Dr.Maggie Dunham.
Spring 2003CSE P5481 Introduction Why memory subsystem design is important CPU speeds increase 55% per year DRAM speeds increase 3% per year rate of increase.
Indexing the Present and Future Positions of Moving Objects Simonas Šaltenis Aalborg University Nykredit Center for Database Research Department of Computer.
Transportation Technologies & Future Applications September 2004.
Redundant Bit Vectors for the Audio Fingerprinting Server John Platt Jonathan Goldstein Chris Burges.
Spatio-Temporal Databases
Fall 2000CS 599 – Spatial and Temporal Databases Research Issues in Spatio- temporal Database Systems Timos Sellis Presented by Handy Patriawan.
Chapter 8 File organization and Indices.
ACM GIS An Interactive Framework for Raster Data Spatial Joins Wan Bae (Computer Science, University of Denver) Petr Vojtěchovský (Mathematics,
Chapter 5. Database Aspects of Location-Based Services Lee Myong Soo Mobile Data Engineering Lab. Dept. of.
Indexing of Network Constrained Moving Objects Dieter Pfoser Christian S. Jensen Chia-Yu Chang.
Dieter Pfoser, LBS Workshop1 Issues in the Management of Moving Point Objects Dieter Pfoser Nykredit Center for Database Research Aalborg University, Denmark.
1 Techniques for Efficient Road- Network-Based Tracking of Moving Objects Speaker : Jia-Hui Huang Date : 2006/10/23.
An Incremental Refining Spatial Join Algorithm for Estimating Query Results in GIS Wan D. Bae, Shayma Alkobaisi, Scott T. Leutenegger Department of Computer.
1 Indexing the Positions of Continuously Moving Objects Speaker: Chia-Hsiang Hsu Date: 2006/10/16.
Scalable Information-Driven Sensor Querying and Routing for ad hoc Heterogeneous Sensor Networks Maurice Chu, Horst Haussecker and Feng Zhao Xerox Palo.
Handling Location Imprecision in Moving Object Database Xinfa Hu March 2007.
Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects Simonas Šaltenis with Rimantas Benetis, Christian S. Jensen, Gytis Karčiauskas.
1 External Sorting for Query Processing Yanlei Diao UMass Amherst Feb 27, 2007 Slides Courtesy of R. Ramakrishnan and J. Gehrke.
Trip Planning Queries F. Li, D. Cheng, M. Hadjieleftheriou, G. Kollios, S.-H. Teng Boston University.
TrafficView: A Driver Assistant Device for Traffic Monitoring based on Car-to-Car Communication Sasan Dashtinezhad, Tamer Nadeem Department of CS, University.
1 Presenter: Chien-Chih Chen Proceedings of the 2002 workshop on Memory system performance.
Video for Mobile Device Mark Green School of Creative Media.
Statistical Methods in Computer Science © 2006-now Gal Kaminka / Ido Dagan 1 Statistical Methods in Computer Science Data 1: Frequency Distributions Ido.
ADITI BHAUMICK ab3585. To use reinforcement learning algorithm with function approximation. Feature-based state representations using a broad characterization.
Fast Subsequence Matching in Time-Series Databases Christos Faloutsos M. Ranganathan Yannis Manolopoulos Department of Computer Science and ISR University.
Database and Data-Intensive Systems. Data-Intensive Systems From monolithic architectures to diverse systems Dedicated/specialized systems, column stores.
Data Warehousing 1 Lecture-24 Need for Speed: Parallelism Virtual University of Pakistan Ahsan Abdullah Assoc. Prof. & Head Center for Agro-Informatics.
The X-Tree An Index Structure for High Dimensional Data Stefan Berchtold, Daniel A Keim, Hans Peter Kriegel Institute of Computer Science Munich, Germany.
February 3, Location Based M-Services The numbers of on-line mobile personal devices increase. New types of context-aware e-services become possible.
Knowledge Discovery from Mobile Phone Communication Activity Data Streams Fergal Walsh Data Stream Research presented in this poster was funded by a Strategic.
Shape-based Similarity Query for Trajectory of Mobile Object NTT Communication Science Laboratories, NTT Corporation, JAPAN. Yutaka Yanagisawa Jun-ichi.
CSIS7101 – Advanced Database Technologies Spatio-Temporal Data (Part 1) On Indexing Mobile Objects Kwong Chi Ho Leo Wong Chi Kwong Simon Lui, Tak Sing.
Geosimulation Geosimulation models are developed to represent phenomena that occur in urban systems in highly realistic manner In particular, Cellular.
Efficient Metric Index For Similarity Search Lu Chen, Yunjun Gao, Xinhan Li, Christian S. Jensen, Gang Chen.
Deconstructing Storage Arrays Timothy E. Denehy, John Bent, Florentina I. Popovici, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau University of Wisconsin,
Bin Yao (Slides made available by Feifei Li) R-tree: Indexing Structure for Data in Multi- dimensional Space.
Event retrieval in large video collections with circulant temporal encoding CVPR 2013 Oral.
Transportation leadership you can trust. presented to Safety Data Analysis Tools Workshop presented by Eric Ziering Cambridge Systematics, Inc. March 27,
Continual Neighborhood Tracking for Moving Objects Yoshiharu Ishikawa Hiroyuki Kitagawa Tooru Kawashima University of Tsukuba, Japan
World Representation for Vehicle Navigation and Standards for Cooperative Vehicles Dr Javier Ibanez-Guzman 31st, January 2007 Orbassano.
February 4, Location Based M-Services Soon there will be more on-line personal mobile devices than on-line stationary PCs. Location based mobile-services.
Cuckoo Filter: Practically Better Than Bloom Author: Bin Fan, David G. Andersen, Michael Kaminsky, Michael D. Mitzenmacher Publisher: ACM CoNEXT 2014 Presenter:
1 Travel Times from Mobile Sensors Ram Rajagopal, Raffi Sevlian and Pravin Varaiya University of California, Berkeley Singapore Road Traffic Control TexPoint.
IMinMax B.C. Ooi, K.-L Tan, C. Yu, S. Stephen. Indexing the Edges -- A Simple and Yet Efficient Approach to High dimensional Indexing. ACM SIGMOD-SIGACT-
Approximation by Constraints Why do we need approximation/interpolation? –Record values at some finite set of points in space and time. –Does not capture.
Rethinking Choices for Multi-dimensional Point Indexing You Jung Kim and Jignesh M. Patel University of Michigan.
1 Overview of Query Evaluation Chapter Outline  Query Optimization Overview  Algorithm for Relational Operations.
Spatial Databases: Spatio-Temporal Databases Spring, 2015 Ki-Joune Li.
What Should a DBMS Do? Store large amounts of data Process queries efficiently Allow multiple users to access the database concurrently and safely. Provide.
Introduction to emulators Tony O’Hagan University of Sheffield.
Indexing the Past, Present, and Anticipated Future Positions of Moving Objects Mindaugas Pelanis, Simonas Saltenis, and Christian S. Jensen
BlinkDB.
BlinkDB.
Empirically Characterizing the Buffer Behaviour of Real Devices
Reinforcement Learning (1)
Chapter 5 Exploiting Memory Hierarchy : Cache Memory in CMP
Issues in Indexing Multi-dimensional indexing:
Spatial Databases: Spatio-Temporal Databases
External Sorting Dina Said
Presentation transcript:

© Christian S. Jensen - CAMM workshop, Providence, RI, January 24-25, 2002 Data Representation and Indexing in Location-Enabled M-Services Christian S. Jensen Nykredit Center for Database Research Aalborg University

© Christian S. Jensen - CAMM workshop, Providence, RI, January 24-25, Background Hardware-related advances are key drivers Miniaturization, positioning, communications, displays, performance/price We don’t sort twice as fast each year on the same hardware Mobile objects include phones, ”PDAs,” vehicles Applications include Safety, metered services, games Traffic, personal productivity, professional services We don’t yet know what the big applications will be! Cf. the SMS experience in Europe

© Christian S. Jensen - CAMM workshop, Providence, RI, January 24-25, Data Representation The objects are “movements” in (space, time) space. Uncertainty is a fundamental part of the game Every measuring technique has an associated precision. Sampling also introduces uncertainty. Issues Choice of sampling policy and interpolation technique Representation of movements Querying Space is not Euclidean, but has infrastructure Hinders (enables) movement or takes the objects to a lower- dimensional space. Issues Exploiting this to reduce uncertainty and to obtain better performance Exploiting this to improve querying behavior

© Christian S. Jensen - CAMM workshop, Providence, RI, January 24-25, Indexing and Precomputation The scenarios considered involve hyper-dynamic data. Indexing and precomputation are still called for. Spatial indices (e.g., R-trees) exhibit poor update performance. Many precomputation techniques assume bulkloading. Improvements are needed. Modeling data as functions.  Updates are needed only when parameters change. Aggressive use of fast memory  Techniques should exploit all available fast memory. Full utilization of the I/O bandwidth  Buffering techniques Approximation techniques Parallellization/partitioning