Approximate achievability in event databases

DOI10.1007/978-3-642-22152-1_62zbMATH Open1341.68039OpenAlexW77251092MaRDI QIDQ3011986FDOQ3011986

Authors: Austin Parker, Gerardo Simari, Amy Sliva, V. S. Subrahmanian 

Publication date: 29 June 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-22152-1_62

Recommendations

• scientific article; zbMATH DE number 1945868
• scientific article; zbMATH DE number 1708019
• scientific article; zbMATH DE number 2080465
• Foundations of Information and Knowledge Systems
• scientific article; zbMATH DE number 4049120

Mathematics Subject Classification ID

History, political science (91F10) Database theory (68P15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Approximate achievability in event databases

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