a movingpoint type for a dbms n.
Skip this Video
Download Presentation
A ‘movingpoint’ type for a DBMS

Loading in 2 Seconds...

play fullscreen
1 / 18

A ‘movingpoint’ type for a DBMS - PowerPoint PPT Presentation

  • Uploaded on

A ‘movingpoint’ type for a DBMS. Wilko Quak - TUDelft. Overview. Clarification Design considerations for movingpoint type Implementation in MonetDB. Moore’s Law makes some problem go away. 50% p/year: - cpu speed - mem size - mem bandwidth - disk bandwidth. #points in laser scan.

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
Download Presentation

PowerPoint Slideshow about 'A ‘movingpoint’ type for a DBMS' - ince

Download Now An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
  • Clarification
  • Design considerations for movingpoint type
  • Implementation in MonetDB

Moving Point Type

moore s law makes some problem go away
Moore’s Law makes some problem go away

50% p/year:

- cpu speed

- mem size

- mem bandwidth

- disk bandwidth

#points in laser scan

#available GPS logs

1% p/year:

- mem latency

10% p/year:

- disk latency

#cadastral parcels

Moving Point Type

what do i want with the data
What do I want with the data?
  • Can I find all occurences of missing data because someone used subway?
  • What is the optimal distance between busstops to get people to the trainstation as fast as possible?
  • Is that man smiling?
  • Flocks and other patterns?
  • More……?

Moving Point Type

  • Should work with all kinds of data
  • Should be extensible (to moving region, or dynamic integer??? (orthogonal?))
  • Queries should be understandable
  • Should work seamlessly together with point/line/polygon + datetime
  • I want to store my original measurements in a reproducably and compact way

Moving Point Type

two possible mappings of movinpoint type to dbms
Two possible mappings of movinpoint type to DBMS:

This is ortogonal but requires a highly extensible DBMS to implement

create table person(

name string,

location point dynamic continuous,

salary integer dynamic discrete);

create table person(

name string

location movingpoint);

This is not that bad and is easier to do in existing DBMS

Moving Point Type

things that should be efficient
Things that should be efficient
  • Range queries in time
  • Range queries on location
  • Nearest neigbour search (Fréchet distance)
  • Joins

Moving Point Type

debatable issues
Debatable Issues
  • What to do with accuracy. (Current implementations of point line an polygon don’t have it. Do we miss it?)
  • More interpolation types than: linear or constant.
  • Do we want a multi-scale type?

Moving Point Type



A novel spatial column-store DBMS

Martin Kersten - CWI

Niels Nes - CWI

Wilko Quak - TUDelft

Maarten Vermeij - TUDelft

monetdb design considerations
MonetDB design considerations
  • Multi-model database kernel support
  • Extensible data types, operators, accelerators
  • Database hot-set is memory resident
  • Simple data structures are better
  • Index management should be automatic
  • Do not replicate the operating system
  • Optimize when you know the situation
  • Cooperative transaction management

Moving Point Type

monetdb physical data organization
MonetDB - Physical data organization
  • Binary Association Tables

Moving Point Type

monetdb product family
MonetDB product family

End-user application








C-mapi lib

MAPI protocol



Moving Point Type

monetdb heap layout

Moving Point Type


This can be compressed away in heap structure

Moving Point Type

implementation options for heap structure
Implementation options for heap structure

1. Implement as BLOB with x1,y1,z1,t1,x2,y2,z2,t2,…

  • Similar to polyline implementations.
  • Index with rtree index on x,y,z,t
  • Is reasonably efficient for small objects.

2. Build a kinetic structure in the heap

  • Will be efficient for querying
  • Compression schema might be tricky

Moving Point Type

conclusions discussion
Conclusions / Discussion
  • DBMS support for multipoints will make querying collections of moving points easier and more efficient.
  • MonetDB looks like a good option for implementation.

Moving Point Type