Gray codes for partial match and range queries

DOI10.1109/32.6184MaRDI QIDQ3809318zbMATH OpenOpenAlexWikidataFDO

Authors 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

distance-preserving mappingsfractalsGray codesmultiattribute hashingpartial match queriessecondary key retrievalspace-filling curves

Mathematics Subject Classification ID

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

Cited in

(10)

• On the \((n,t)\)-antipodal Gray codes
• Space-filling curves and their use in the design of geometric data structures
• A heuristic approach for constructing symmetric Gray codes
• Heavy-tailed configuration models at criticality
• Thresholds for virus spread on networks
• Optimality of clustering properties of space-filling curves
• Approximate covering detection among content-based subscriptions using space filling curves
• Scale-free and small-world properties of a special hierarchical network
• Space filling curves and their use in the design of geometric data structures
• Multidimensional term indexing for efficient processing of complex queries

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3809318)