Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Erschienen in:
Introduction Kapitel lesen Erstes Kapitel lesen

2014 | OriginalPaper | Buchkapitel

2. Background on Spatial Data Management and Exploration

verfasst von : Nikos Pelekis, Yannis Theodoridis

Erschienen in: Mobility Data Management and Exploration

Verlag: Springer New York

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Before studying mobility data, we have to make a short tour at the (stationary) spatial domain. For decades, spatial information has been studied thoroughly; from Cartography and Geodesy to Geographical Information Systems (GIS) and Spatial Database Management Systems (SDBMS); this is justified due to its importance and ubiquity in our everyday lives. Database community has followed the paradigm of extended DBMS and provided inherent spatial functionality in geographical data collections by developing spatial data types, operators and methods for querying, as well as indexing techniques. At the exploration level, multi-dimensional online analytical processing (OLAP) and knowledge discovery in databases (KDD) have attracted excellent results at the spatial domain. In this chapter, we review spatial database management (modeling, indexing, query processing) and exploration aspects (data warehousing and OLAP analysis, data mining), followed by a short discussion on data privacy aspects. This is essential knowledge in order for the reader to get familiar with background terms and notions during the corresponding discussion in the mobility data domain, in the chapters that will follow.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren
Vorheriges Kapitel Introduction
Nächstes Kapitel Modeling and Acquiring Mobility Data
Literatur
Agrawal R, Srikant R (2000) Privacy-preserving data mining. In: Proceedings of SIGMOD
Andrienko N, Andrienko G, Pelekis N, Spaccapietra S (2008) Basic concepts of movement data. In: Giannotti F, Pedreschi D (eds) Mobility, data mining and privacy—geographic knowledge discovery. Springer, New York, pp 15–38
Ankerst M, Breunig MM, Kriegel HP, Sander J (1999) OPTICS: ordering points to identify the clustering structure. In: Proceedings of SIGMOD
Beckmann N, Kriegel HP, Schneider R, Seeger B (1990) The R*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of SIGMOD
Brinkhoff T, Kriegel HP, Seeger B (1993) Efficient processing of spatial joins using R-trees. In: Proceedings of SIGMOD
Cheung KL, Fu A (1998) Enhanced nearest neighbor search on the R-tree. SIGMOD Rec 27(3):16–21CrossRef
Corral A, Manolopoulos Y, Theodoridis Y, Vassilakopoulos M (2000) Closest pair queries in spatial databases. In: Proceedings of SIGMOD
Corral A, Manolopoulos Y, Theodoridis Y, Vassilakopoulos M (2006) Cost models for distance joins queries using R-trees. Data Knowl Eng 57(1):1–36CrossRef
Egenhofer MJ (1989) A formal definition of binary topological relationships. In: Proceedings of FODO
Egenhofer MJ, Herring J (1991) Categorizing binary topological relations between regions, lines and points in geographic databases. Technical Report, University of Maine
Ester M, Kriegel HP, Sander J, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of KDD
Fayyad UM, Piatetsky-Shapiro G, Smyth P (1996) From data mining to knowledge discovery: an overview. In: Fayyad UM, Piatetsky-Shapiro G, Smyth P, Uthurusamy R (eds) Advances in knowledge discovery and data mining. MIT Press, Cambridge, MA, pp 1–34
Ferhatosmanoglou H, Stanoi I, Agrawal D, Abbadi A (2001) Constrained nearest neighbor queries. In: Proceedings of SSTD
Fung B, Wang K, Chen R, Yu P (2010) Privacy-preserving data publishing: a survey of recent developments. ACM Comput Surv 42(4):1–55CrossRef
Gray J, Chaudhuri S, Bosworth A, Layman A, Reichart D, Venkatrao M, Pellow F, Pirahesh H (1997) Data cube: a relational aggregation operator generalizing group-by, cross-tab, and sub-totals. Data Min Knowl Disc 1(1):29–53CrossRef
Guha S, Rastogi R, Shim K (1998) CURE: an efficient clustering algorithm for large databases. In: Proceedings of SIGMOD
Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: Proceedings of SIGMOD
Han J, Stefanovic N, Koperski K (1998) Selective materialization: an efficient method for spatial data cube construction. In: Proceedings of PAKDD
Hjaltason G, Samet H (1998) Incremental distance join algorithms for spatial databases. In: Proceedings of SIGMOD
Hjaltason G, Samet H (1999) Distance browsing in spatial databases. ACM Trans Database Syst 24(2):265–318CrossRef
Inmon WH (1992) Building the data warehouse. Wiley, New York
Jensen CS, Kolarvr J, Pedersen TB, Timko I (2003) Nearest neighbor queries in road networks. In: Proceedings of GIS
Kamel I, Faloutsos C (1994) Hilbert R-tree: an improved R-tree using fractals. In: Proceedings of VLDB
Kollios G, Gunopulos D, Koudas N, Berchtold S (2002) Efficient biased sampling for approximate clustering and outlier detection in large datasets. IEEE Trans Knowl Data Eng 15(5):1170–1187CrossRef
Lee KCK, Lee WC, Leong HV (2010) Nearest surrounder queries. IEEE Trans Knowl Data Eng 22(10):1444–1458CrossRef
Li N, Li T, Venkatasubramanian S (2007) t-closeness: privacy beyond k-anonymity and l-diversity. In: Proceedings of ICDE
Machanavajjhala A, Gehrke J, Kifer D, Venkitasubramaniam M (2006) l-diversity: privacy beyond k-anonymity. In: Proceedings of ICDE
MacQueen JB (1967) Some methods for classification and analysis of multivariate observations. In: Proceedings of BSMSP
Malinowski E, Zimányi E (2008) Advanced data warehouse design: from conventional to spatial and temporal applications. Springer, New York
Mamoulis N, Papadias D (2001) Multiway spatial joins. ACM Trans Database Syst 26(4):424–475CrossRefMATH
Manolopoulos Y, Nanopoulos A, Papadopoulos AN, Theodoridis Y (2005) R-trees: theory and applications. Springer, New York
Nanopoulos A, Theodoridis Y, Manolopoulos Y (2001) C2P: clustering based on closest pairs. In: Proceedings of VLDB
Nanopoulos A, Theodoridis Y, Manolopoulos Y (2006) Index-based density biased sampling for clustering applications. Data Knowl Eng 57(1):37–63CrossRef
Orenstein JA (1986) Spatial query processing in an object-oriented database system. In: Proceedings of SIGMOD
Papadias D, Theodoridis Y (1997) Spatial relations, minimum bounding rectangles, and spatial data structures. Int J Geogr Inf Sci 11(2):111–138CrossRef
Papadias D, Theodoridis Y, Sellis TK, Egenhofer MJ (1995) Topological relations in the world of minimum bounding rectangles: a study with R-trees. In: Proceedings of SIGMOD
Papadias D, Mamoulis N, Theodoridis Y (1999) Processing and optimization of multiway spatial joins using R-trees. In: Proceedings of PODS
Papadias D, Mamoulis N, Theodoridis Y (2001a) Constrained-based processing of multiway spatial joins. Algorithmica 30(2):188–215CrossRefMATHMathSciNet
Papadias D, Kalnis P, Zhang J, Tao Y (2001b) Efficient OLAP operations in spatial data warehouses. In: Proceedings of SSTD
Papadopoulos A, Manolopoulos Y (1997) Performance of nearest neighbor queries in R-trees. In: Proceedings of ICDT
Roussopoulos N, Kelley S, Vincent F (1995) Nearest neighbor queries. In: Proceedings of SIGMOD
Sellis TK, Roussopoulos N, Faloutsos C (1987) The R+−tree: a dynamic index for multi-dimensional objects. In: Proceedings of VLDB
Sharifzadeh M, Shahabi C (2010) VoR-tree: R-trees with Voronoi diagrams for efficient processing of spatial nearest neighbor queries. In: Proceedings of VLDB
Shekhar S, Chawla S (2003) Spatial databases: a tour. Prentice Hall, Upper Saddle River, NJ
Shekhar S, Huang Y (2001) Discovering spatial co-location patterns. In: Proceedings of SSTD
Shekhar S, Zhang P, Huang Y (2010) Spatial data mining. In: Maimon O, Rokach L (eds) Data mining and knowledge discovery handbook, 2/e. Springer, New York
Tan PN, Steinbach M, Kumar V (2005) Introduction to data mining. Addison-Wesley, Boston
Theodoridis Y, Stefanakis E, Sellis TK (2000) Efficient cost models for spatial queries using R-trees. IEEE Trans Knowl Data Eng 12(1):19–32CrossRef
Tung AKH, Hou J, Han J (2001) Spatial clustering in the presence of obstacles. In: Proceedings of ICDE
Verykios VS, Bertino E, Fovino IN, Parasiliti Provenza L, Saygin Y, Theodoridis Y (2004) State-of-the-art in privacy preserving data mining. SIGMOD Rec 33(1):50–57CrossRef
Wang W, Yang J, Muntz R (1997) STING: a statistical information grid approach to spatial data mining. In: Proceedings of VLDB
Zhang T, Ramakrishnan R, Linvy M (1996) BIRCH: an efficient data clustering method for very large databases. In: Proceedings of SIGMOD
Zhang J, Mamoulis N, Papadias D, Tao Y (2004) All-nearest-neighbors queries in spatial databases. In: Proceedings of SSDBM
Metadaten
Titel
Background on Spatial Data Management and Exploration
verfasst von
Nikos Pelekis
Yannis Theodoridis
Copyright-Jahr
2014
Verlag
Springer New York
Buch
Mobility Data Management and Exploration

Print ISBN: 978-1-4939-0391-7

Electronic ISBN: 978-1-4939-0392-4

Copyright-Jahr: 2014

DOI
https://doi.org/10.1007/978-1-4939-0392-4_2

Premium Partner

    Bildnachweise