Reordering columns for smaller indexes
From MaRDI portal
Publication:545370
DOI10.1016/j.ins.2011.02.002zbMath1218.68078WikidataQ56700188 ScholiaQ56700188MaRDI QIDQ545370
Publication date: 22 June 2011
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: http://r-libre.teluq.ca/231/1/0909.1346v8.pdf
68P10: Searching and sorting
68P15: Database theory
68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conditional edge-fault-tolerant Hamiltonicity of dual-cubes
- Using multiset discrimination to solve language processing problems without hashing
- Attribute value reordering for efficient hybrid OLAP
- The bipancycle-connectivity of the hypercube
- Balancing cyclic \(R\)-ary Gray codes. II.
- Locality and bounding-box quality of two-dimensional space-filling curves
- Data compression and Gray-code sorting
- Towards optimal locality in mesh-indexings
- On multidimensional curves with Hilbert property
- Balancing cyclic \(R\)-ary Gray codes
- Compact Hilbert indices: space-filling curves for domains with unequal side lengths
- Compressing table data with column dependency
- A Survey of Combinatorial Gray Codes
- A note on the NP-hardness of the consecutive block minimization problem
- Mixed-Radix Gray Codes in Lee Metric
- Four-Dimensional Hilbert Curves for R-Trees
- Run-length encodings (Corresp.)