Skip to main content
  • Conference proceedings
  • © 2013

Spatial and Temporal Databases

13th International Symposium, SSTD 2013, Munich, Germany, August 21-23, 2013, Proceedings

  • Proceedings of the 13th International Symposium on Spatial and Temporal Databases, SSTD 2013

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 8098)

Part of the book sub series: Information Systems and Applications, incl. Internet/Web, and HCI (LNISA)

Conference series link(s): SSTD: International Symposium on Spatial and Temporal Databases

Conference proceedings info: SSTD 2013.

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (35 papers)

  1. Front Matter

  2. Session 1: Joins and Algorithms

    1. Efficient Top-k Spatial Distance Joins

      • Shuyao Qi, Panagiotis Bouros, Nikos Mamoulis
      Pages 1-18
    2. Regional Co-locations of Arbitrary Shapes

      • Song Wang, Yan Huang, Xiaoyang Sean Wang
      Pages 19-37
    3. MNTG: An Extensible Web-Based Traffic Generator

      • Mohamed F. Mokbel, Louai Alarabi, Jie Bao, Ahmed Eldawy, Amr Magdy, Mohamed Sarwat et al.
      Pages 38-55
    4. Capacity-Constrained Network-Voronoi Diagram: A Summary of Results

      • KwangSoo Yang, Apurv Hirsh Shekhar, Dev Oliver, Shashi Shekhar
      Pages 56-73
  3. Session 2: Mining and Discovery

    1. Mining Driving Preferences in Multi-cost Networks

      • Adrian Balteanu, Gregor Jossé, Matthias Schubert
      Pages 74-91
    2. Mining Sub-trajectory Cliques to Find Frequent Routes

      • Htoo Htet Aung, Long Guo, Kian-Lee Tan
      Pages 92-109
    3. Discovering Influential Data Objects over Time

      • Orestis Gkorgkas, Akrivi Vlachou, Christos Doulkeridis, Kjetil Nørvåg
      Pages 110-127
    4. Finding Traffic-Aware Fastest Paths in Spatial Networks

      • Shuo Shang, Hua Lu, Torben Bach Pedersen, Xike Xie
      Pages 128-145
  4. Session 3: Indexing

    1. Geodetic Distance Queries on R-Trees for Indexing Geographic Data

      • Erich Schubert, Arthur Zimek, Hans-Peter Kriegel
      Pages 146-164
    2. Energy Efficient In-Network Data Indexing for Mobile Wireless Sensor Networks

      • Mohamed M. Ali Mohamed, Ashfaq Khokhar, Goce Trajcevski
      Pages 165-182
    3. PL-Tree: An Efficient Indexing Method for High-Dimensional Data

      • Jie Wang, Jian Lu, Zheng Fang, Tingjian Ge, Cindy Chen
      Pages 183-200
  5. Session 4: Trajectories and Road Network Data 1

    1. Stream-Mode FPGA Acceleration of Complex Pattern Trajectory Querying

      • Roger Moussalli, Marcos R. Vieira, Walid Najjar, Vassilis J. Tsotras
      Pages 201-222
    2. Best Upgrade Plans for Large Road Networks

      • Yimin Lin, Kyriakos Mouratidis
      Pages 223-240
    3. Group Trip Planning Queries in Spatial Databases

      • Tanzima Hashem, Tahrima Hashem, Mohammed Eunus Ali, Lars Kulik
      Pages 259-276
  6. Session 5: Nearest Neighbours Queries

    1. Reverse-k-Nearest-Neighbor Join Processing

      • Tobias Emrich, Hans-Peter Kriegel, Peer Kröger, Johannes Niedermayer, Matthias Renz, Andreas Züfle
      Pages 277-294
    2. DART: An Efficient Method for Direction-Aware Bichromatic Reverse k Nearest Neighbor Queries

      • Kyoung-Won Lee, Dong-Wan Choi, Chin-Wan Chung
      Pages 295-311
    3. User-Contributed Relevance and Nearest Neighbor Queries

      • Christodoulos Efstathiades, Dieter Pfoser
      Pages 312-329
  7. Session 6: Trajectories and Road Network Data 2

Other Volumes

  1. Advances in Spatial and Temporal Databases

About this book

This book constitutes the refereed proceedings of the 13th International Symposium on Spatial and Temporal Databases, SSTD 2013, held in Munich, Germany, in August 2013. The 24 revised full papers presented were carefully reviewed and selected from 58 submissions. The papers are organized in topical sections on joins and algorithms; mining and discovery; indexing; trajectories and road network data; nearest neighbours queries; uncertainty; and demonstrations.

Editors and Affiliations

  • University of Alberta, Edmonton, Canada

    Mario A. Nascimento

  • RMIT University, Melbourne, Australia

    Timos Sellis

  • Department of Computer Science, The University of Hong Kong, Hong Kong

    Reynold Cheng

  • Dept. of Computing Science, University of Alberta, Edmonton, Canada,

    Jörg Sander

  • Microsoft Research Asis, Beijing, China

    Yu Zheng

  • Institute for Informatics, Ludwig Maximilian University, Munich, Germany

    Hans-Peter Kriegel

  • Institute for Informatics, Ludwig-Maximilians-Universität München, München, Germany

    Matthias Renz

  • Ruprecht-Karls-University, Heidelberg, Germany

    Christian Sengstock

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access