A tractable query cache by approximation

DOI10.1007/3-540-45622-8_11MaRDI QIDQ4737588zbMATH OpenFDO

Authors Daniel P. Miranker, Malcolm C. Taylor, Anand Padmanaban

Publication date 11 August 2004

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/2371/23710140.htm

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Efficient Approximations of Conjunctive Queries
• Efficient cache answerability for XPath queries
• Cache investment
• Semantic cache -- optimizing the semistructured data queries
• Regular path queries under approximate semantics

Cited in

(2)

• Ontology-based semantic cache in AOKB
• Cache investment

This page was built for publication: A tractable query cache by approximation

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