The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Analysis of the clustering properties of the Hilbert space-filling curve
Abstract
AbstractÐSeveral schemes for the linear mapping of a multidimensional space have been proposed for various applications, such as access methods for spatio-temporal databases and image compression. In these applications, one of the most desired properties from such linear mappings is clustering, which means the locality between objects in the multidimensional space being preserved in the linear space. It is widely believed that the Hilbert space-filling curve achieves the best clustering [1], [14]. In this paper, we analyze the clustering property of the Hilbert space-filling curve by deriving closed-form formulas for the number of clusters in a given query region of an arbitrary shape (e.g., polygons and polyhedra). Both the asymptotic solution for the general case and the exact solution for a special case generalize previous work [14]. They agree with the empirical results that the number of clusters depends on the hypersurface area of the query region and not on its hypervolume. We also show that the Hilbert curve achieves better clustering than the z curve. From a practical point of view, the formulas given in this paper provide a simple measure that can be used to predict the required disk access behaviors and, hence, the total access time.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Ueber die stetige Abbildung einer Line auf ein Fl�chenst�ck
Hilbert, D. (1891) · Mathematische Annalen · doi:10.1007/bf01199431 · Cited by 918
Introduction to Topology and Modern Analysis.
Danese, A. E., & Simmons, G. F. (1964) · The American Mathematical Monthly · doi:10.2307/2313284 · Cited by 727
Sur une courbe, qui remplit toute une aire plane
Peano, G. (1890) · Mathematische Annalen · doi:10.1007/bf01199438 · Cited by 684
Sur une courbe, qui remplit toute une aire plane
Peano, G. (1990) · Teubner-Archiv zur Mathematik · doi:10.1007/978-3-7091-9537-6_6 · Cited by 511
Giblin, P. (2010) · Cambridge University Press eBooks · doi:10.1017/cbo9780511779534 · Cited by 246
Partial-Match Retrieval Algorithms
Rivest, R. L. (1976) · SIAM Journal on Computing · doi:10.1137/0205003 · Cited by 244
Analysis of the Hilbert curve for representing two-dimensional space
Jagadish, H. V. (1997) · Information Processing Letters · doi:10.1016/s0020-0190(97)00014-8 · Cited by 116
Self-citation
Cited by
General purpose molecular dynamics simulations fully implemented on graphics processing units
Anderson, J. A., Lorenz, C. D., & Travesset, A. (2008) · Journal of Computational Physics · doi:10.1016/j.jcp.2008.01.047 · Cited by 1,481
A survey on unsupervised outlier detection in high‐dimensional numerical data
Zimek, A., Schubert, E., & Kriegel, H. (2012) · Statistical Analysis and Data Mining The ASA Data Science Journal · doi:10.1002/sam.11161 · Cited by 864
Private queries in location based services: anonymizers are not necessary
Ghinita, G., Kalnis, P., Khoshgozaran, A., Shahabi, C., & Tan, K.-L. (2008) · Proceedings of the 2008 ACM SIGMOD international conference on Management of data · doi:10.1145/1376616.1376631 · Cited by 758
Preventing Location-Based Identity Inference in Anonymous Spatial Queries
Kalnis, P., Ghinita, G., Mouratidis, K., & Papadias, D. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.190662 · Cited by 620
Hybrid LSTM and Encoder–Decoder Architecture for Detection of Image Forgeries
Bappy, J. H., Simons, C., Nataraj, L., Manjunath, B. S., & Roy-Chowdhury, A. K. (2019) · IEEE Transactions on Image Processing · doi:10.1109/tip.2019.2895466 · Cited by 477
Metadata
- Authors
- Moon, B., Jagadish, H. V., Faloutsos, C., & Saltz, J. H.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2001
- Volume
- 13
- Issue
- 1
- Pages
- 124-141
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2159772324
- Cited by
- 736
- References
- 7
- FWCI
- 29.20
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.