Variable sized partitions for range query algorithms

DOI10.1007/3-540-46146-9_20MaRDI QIDQ4410603zbMATH OpenFDO

Authors Tok Wang Ling, Zhong Wei Luo, Sin Yeung Lee, Huagang Li, Wai Chong Low

Publication date 3 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2453/24530193.htm

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Computing methodologies and applications (68U99)

Recommendations

• Partitioning Space for Range Queries
• Range partitioning within sublinear time: algorithms and lower bounds
• EFFICIENT PARALLEL RANGE SEARCHING AND PARTITIONING ALGORITHMS*
• Range partitioning within sublinear time in the external memory model
• Approximate range searching using binary space partitions
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Computing and Combinatorics
• Opportunistic data structures for range queries
• Data structures for range-aggregate extent queries

Cited in

(2)

• Range queries in dynamic OLAP data cubes
• Range top/bottom k queries in OLAP sparse data cubes

This page was built for publication: Variable sized partitions for range query algorithms

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