Gray codes for partial match and range queries

DOI10.1109/32.6184zbMath0659.68125OpenAlexW2060454056WikidataQ59552548 ScholiaQ59552548MaRDI QIDQ3809318

Christos Faloutsos

Publication date: 1988

Published in: IEEE Transactions on Software Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/32.6184

zbMATH Keywords

fractalsspace-filling curvesGray codesdistance-preserving mappingspartial match queriessecondary key retrievalmultiattribute hashing

Mathematics Subject Classification ID

Searching and sorting (68P10) Information storage and retrieval of data (68P20) Combinatorial codes (94B25)

Related Items (10)

A heuristic approach for constructing symmetric Gray codes ⋮ Approximate covering detection among content-based subscriptions using space filling curves ⋮ Space filling curves and their use in the design of geometric data structures ⋮ Space-filling curves and their use in the design of geometric data structures ⋮ Thresholds for virus spread on networks ⋮ Heavy-tailed configuration models at criticality ⋮ Optimality of Clustering Properties of Space-Filling Curves ⋮ SCALE-FREE AND SMALL-WORLD PROPERTIES OF A SPECIAL HIERARCHICAL NETWORK ⋮ On the \((n,t)\)-antipodal Gray codes ⋮ Unnamed Item

This page was built for publication: Gray codes for partial match and range queries