scientific article; zbMATH DE number 1515868

MaRDI QIDQ4508949zbMATH OpenFDO

Authors Sridhar Ramaswamy

Publication date 10 October 2000

zbMATH Keywords

constraint databases

Mathematics Subject Classification ID

Database theory (68P15) Nonnumerical algorithms (68W05)

Recommendations

• Cache and I/O efficent functional algorithms
• I/O-efficient data structures for non-overlapping indexing
• I/O-efficient hierarchical diameter approximation
• scientific article; zbMATH DE number 1947384
• Algorithm Theory - SWAT 2004
• Fine-grained I/O complexity via reductions: new lower bounds, faster algorithms, and a time hierarchy
• I/O-efficient range minima queries
• scientific article; zbMATH DE number 1303612
• I/O-efficient well-separated pair decomposition and applications
• I/O-Efficient Algorithms for Topological Sort and Related Problems

Cited in

(3)

• Toward practical query evaluation for constraint databases
• I/O-efficient well-separated pair decomposition and applications
• Towards optimal two-dimensional indexing for constraint databases

This page was built for publication:

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