Searching and sorting (68P10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Database theory (68P15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Recommendations
Cites work
- scientific article; zbMATH DE number 5841426 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2176112 (Why is no real title available?)
- A Survey of Combinatorial Gray Codes
- A note on the NP-hardness of the consecutive block minimization problem
- Attribute value reordering for efficient hybrid OLAP
- Balancing cyclic \(R\)-ary Gray codes
- Balancing cyclic \(R\)-ary Gray codes. II.
- Compact Hilbert indices: space-filling curves for domains with unequal side lengths
- Compressing table data with column dependency
- Conditional edge-fault-tolerant Hamiltonicity of dual-cubes
- Data compression and Gray-code sorting
- Four-dimensional Hilbert curves for R-trees
- Locality and bounding-box quality of two-dimensional space-filling curves
- Mixed-Radix Gray Codes in Lee Metric
- On multidimensional curves with Hilbert property
- Run-length encodings (Corresp.)
- The bipancycle-connectivity of the hypercube
- Towards optimal locality in mesh-indexings
- Using multiset discrimination to solve language processing problems without hashing
Cited in
(3)
This page was built for publication: Reordering columns for smaller indexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q545370)