Article

Free access

Linear clustering of objects with multiple attributes

Author:

H. V. JagadishAuthors Info & Claims

SIGMOD '90: Proceedings of the 1990 ACM SIGMOD international conference on Management of data

Pages 332 - 342

https://doi.org/10.1145/93597.98742

Published: 01 May 1990 Publication History

Abstract

There is often a need to map a multi-dimensional space on to a one-dimensional space. For example, this kind of mapping has been proposed to permit the use of one-dimensional indexing techniques to a multi-dimensional index space such as in a spatial database. This kind of mapping is also of value in assigning physical storage, such as assigning buckets to records that have been indexed on multiple attributes, to minimize the disk access effort.

In this paper, we discuss what the desired properties of such a mapping are, and evaluate, through analysis and simulation, several mappings that have been proposed in the past. We present a mapping based on Hilbert's space-filling curve, which out-performs previously proposed mappings on average over a variety of different operating conditions.

References

[1]

Norbert Beckmann, Hans-Peter Krlegel, Ralf Schneider, and Bernhard Seeger, "The R*-tree An Efficient and Robust Access Method for Points and Rectangles," Proc ACM-SIGMOD Conf on the Management of Data, Atlantac City, NJ, May 1990

Digital Library

[2]

T Blally, "Space-Filling Curves Their Generation and Thetr Apphcatlon to Bandwidth Reduction," IEEE Trans on lnformatton Theory, IT-15(6), Nov 1969, 658-664

[3]

A R Butz, "AltemaUve Algorithm for Hflbert's Space-Filling Curve," IEEE Transactwn on Computers, C-20, Apr 1971, 424-426

Digital Library

[4]

R Fagm, J Nlevergelt, N Plppenger, and H R Strong, "Extendible Hashing --- A Fast Access Method for Dynarmc Files," ACM Trans on Database Systems, 4(3), Sept. 1979, 315-344

Digital Library

[5]

C Faloutsos, "Muluattnbute Hashing Using Gray Codes," Proc ACM-SIGMOD Int'l Conf on the Management of Data, Washington, D C, 1985, 227-238

Digital Library

[6]

C Faloutsos, "Gray Codes for Parual Match and Range Queries," IEEE Trans on Software Engmeermg, 1987

Digital Library

[7]

C Faloutsos and S Roseman, "Fractals for Secondary Key Remeval," Proc of the ACM Conf on the Principles of Database Systems, March 1989, 247-252

Digital Library

[8]

A Guttman, "R Trees A Dynamic index Structure for Spataal Searching," Proc ACM SIGMOD lnt'l Conf on the Management of Data, 1984, 47-57

Digital Library

[9]

D Halbert, "Uber die steltlge Abbddung emer lame auf em Flachenstuck," Math Ann, 38, 1891

[10]

H V Jagadtsh, "Spattal Search with Polyhedra," Proc Int'l Conf on Data Engineering, Los Angeles, CA, Feb 1990

Digital Library

[11]

P-A Larson, "Dynamic Hashing," B/T, 18, 1978, 184- 201

[12]

W Lltwm, "Linear Hashing A New Tool for Fde and Table Addressing," Proc of the Sooth Int'l Conf on Very Large Databases, Montreal, 1980, 212-223

[13]

J Nlevergelt, H Hlnterberger, and K C Sevctk, "The Gnd file An Adaptable Symmetric Multtkey Fde Structure," ACM Trans on Database Systems, 9(1), 1984

Digital Library

[14]

J A Oremtem and T H Merett, "A Class of Data Structures for Assoclat~ve Searclung," Proc Thtrd SIGACT News SIGMOD Sympostum on the Principles of Database Systems, 1984, 181-190

Digital Library

[15]

J A Oremtem, "Spatml Query Processing m an Object-Oriented Database System," Proc ACM SIGMOD lnt'l Cont" on the Management of Data, 1986, 326-336

Digital Library

[16]

J A Orenstem, "Redundancy m Spatial Databases," Proc ACM SIGMOD Int'l Conf on the Management of Data, Portland, OR, May-June 1989

Digital Library

[17]

E A Patrick, D R Anderson, and F K Bechtel, "Mapping Multldtmenslonal Space to One Dtmenslon for Computer Output Display," IEEE Trans Computers, C-17, Oct 1968, 949-953

Digital Library

[18]

G Peano, "Sur une courbe qm rempht toute une rare plame," Math Ann, 36, 1890

[19]

J B Rothme and T Lozano, "Attrlbute Based File Orgamzat~on m a Paged Memory Envtronment," Commumcatwn of the ACM, 17(2), Feb 1974, 63-69

Digital Library

[20]

H Samet, "Hlerarclucal Representauon of Collecttons of Small Rectangles," ACM Computing Surveys, 20(4), December 1988, 271-309

Digital Library

[21]

T Selhs, N Roussopoulos, and C Faloutsos, "The R+ Tree A Dynarmc Index for Multadunenslonal Objects," Proc 13th Int'l Conf on Very Large Databases, Bnghton, U K, Sep 1987, 507-518

Digital Library

[22]

Y Tanaka, "Adaptlve Segmentatton Schemes for Large Relataonal Database Machines," Proc 3rd International Conference on Database Machines, Mumch, FRG, 1983

Cited By

Sharma HNarang GDoppa JOgras UPande P(2024)Dataflow-Aware PIM-Enabled Manycore Architecture for Deep Learning Workloads2024 Design, Automation & Test in Europe Conference & Exhibition (DATE)10.23919/DATE58400.2024.10546730(1-6)Online publication date: 25-Mar-2024
https://doi.org/10.23919/DATE58400.2024.10546730
Hansert PMichel S(2024)Partition, Don't Sort! Compression Boosters for Cloud Data Ingestion PipelinesProceedings of the VLDB Endowment10.14778/3681954.368201317:11(3456-3469)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.14778/3681954.3682013
Qi JJia XLuo MFeng Q(2024) A Privacy-Aware K -Nearest Neighbor Query Scheme for Location-Based Services IEEE Internet of Things Journal10.1109/JIOT.2023.332870911:6(10831-10842)Online publication date: 15-Mar-2024
https://doi.org/10.1109/JIOT.2023.3328709
Show More Cited By

Index Terms

Linear clustering of objects with multiple attributes
1. Information systems
  1. Data management systems
    1. Database design and models
    2. Database management system engines
      1. Database query processing
2. Theory of computation
  1. Design and analysis of algorithms
    1. Data structures design and analysis
      1. Sorting and searching
  2. Theory and algorithms for application domains
    1. Database theory
      1. Database query processing and optimization (theory)

Recommendations

Linear clustering of objects with multiple attributes

There is often a need to map a multi-dimensional space on to a one-dimensional space. For example, this kind of mapping has been proposed to permit the use of one-dimensional indexing techniques to a multi-dimensional index space such as in a spatial ...
Linear mapping for indoor spatial objects
ISA '15: Proceedings of the Seventh ACM SIGSPATIAL International Workshop on Indoor Spatial Awareness

A linear mapping is a technique that stores objects with multi-dimensional properties in data storage in a certain order. The mapping aims at preserving spatial locality, which means that objects in the same cluster are likely to be accessed together. ...
A Systematic Approach to Clustering Whole Trajectories of Mobile Objects in Road Networks

Most of mobile object trajectory clustering analysis to date has been focused on clustering the location points or sub-trajectories extracted from trajectory data. This paper presents TraceMob, a systematic approach to clustering whole trajectories of ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGMOD '90: Proceedings of the 1990 ACM SIGMOD international conference on Management of data

May 1990

398 pages

ISBN:0897913655

DOI:10.1145/93597

Chairman:
Hector Garcia-Molina
Princeton Univ., Princeton, NJ

ACM SIGMOD Record Volume 19, Issue 2
Jun. 1990
392 pages
ISSN:0163-5808
DOI:10.1145/93605
Editor:
H. V. Jagadish
AT&T Bell Laboratories, Murray Hill, NJ
Issue’s Table of Contents

Copyright © 1990 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGMOD: ACM Special Interest Group on Management of Data

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1990

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMOD 90

Sponsor:

SIGMOD

SIGMOD 90: SIGMOD'90

May 23 - 26, 1990

New Jersey, Atlantic City, USA

Acceptance Rates

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

364
Total Citations
View Citations
1,747
Total Downloads

Downloads (Last 12 months)123
Downloads (Last 6 weeks)13

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Sharma HNarang GDoppa JOgras UPande P(2024)Dataflow-Aware PIM-Enabled Manycore Architecture for Deep Learning Workloads2024 Design, Automation & Test in Europe Conference & Exhibition (DATE)10.23919/DATE58400.2024.10546730(1-6)Online publication date: 25-Mar-2024
https://doi.org/10.23919/DATE58400.2024.10546730
Hansert PMichel S(2024)Partition, Don't Sort! Compression Boosters for Cloud Data Ingestion PipelinesProceedings of the VLDB Endowment10.14778/3681954.368201317:11(3456-3469)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.14778/3681954.3682013
Qi JJia XLuo MFeng Q(2024) A Privacy-Aware K -Nearest Neighbor Query Scheme for Location-Based Services IEEE Internet of Things Journal10.1109/JIOT.2023.332870911:6(10831-10842)Online publication date: 15-Mar-2024
https://doi.org/10.1109/JIOT.2023.3328709
Li JWang ZCong GLong CKiah HCui B(2023)Towards Designing and Learning Piecewise Space-Filling CurvesProceedings of the VLDB Endowment10.14778/3598581.359858916:9(2158-2171)Online publication date: 10-Jul-2023
https://dl.acm.org/doi/10.14778/3598581.3598589
Sharma HPfromm LTopaloglu RDoppa JOgras UKalyanraman APande P(2023)Florets for Chiplets: Data Flow-aware High-Performance and Energy-efficient Network-on-Interposer for CNN Inference TasksACM Transactions on Embedded Computing Systems10.1145/360809822:5s(1-21)Online publication date: 31-Oct-2023
https://dl.acm.org/doi/10.1145/3608098
Widmoser MKocher DAugsten NMann W(2023)MetricJoin: Leveraging Metric Properties for Robust Exact Set Similarity Joins2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00085(1045-1058)Online publication date: Apr-2023
https://doi.org/10.1109/ICDE55515.2023.00085
Lee JKwon TSeo MJung S(2023)Hierarchical Quadrant Spatial LSM Tree for Indexing Blockchain-Based Geospatial Point DataIEEE Access10.1109/ACCESS.2023.332625611(118088-118104)Online publication date: 2023
https://doi.org/10.1109/ACCESS.2023.3326256
Park JLee D(2022)Parallelly Running and Privacy-Preserving k-Nearest Neighbor Classification in Outsourced Cloud Computing EnvironmentsElectronics10.3390/electronics1124413211:24(4132)Online publication date: 11-Dec-2022
https://doi.org/10.3390/electronics11244132
Lv SLiu Y(2022)PLVA: Privacy-Preserving and Lightweight V2I Authentication ProtocolIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2021.305963823:7(6633-6639)Online publication date: 1-Jul-2022
https://dl.acm.org/doi/10.1109/TITS.2021.3059638
Yan JDing ZZhang S(2022)An Object Separated Storage Framework Towards Spatiotemporal Point Data Fast QueryInformation Integration and Web Intelligence10.1007/978-3-031-21047-1_19(211-223)Online publication date: 20-Nov-2022
https://doi.org/10.1007/978-3-031-21047-1_19
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents