Hypothetical answers to continuous queries over data streams

May 23, 2019 Β· Declared Dead Β· πŸ› ACM Transactions on Computational Logic

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors LuΓ­s Cruz-Filipe, GraΓ§a Gaspar, Isabel Nunes arXiv ID 1905.09610 Category cs.PL: Programming Languages Cross-listed cs.AI Citations 3 Venue ACM Transactions on Computational Logic Last Checked 4 months ago
Abstract
Continuous queries over data streams may suffer from blocking operations and/or unbound wait, which may delay answers until some relevant input arrives through the data stream. These delays may turn answers, when they arrive, obsolete to users who sometimes have to make decisions with no help whatsoever. Therefore, it can be useful to provide hypothetical answers - "given the current information, it is possible that X will become true at time t" - instead of no information at all. In this paper we present a semantics for queries and corresponding answers that covers such hypothetical answers, together with an online algorithm for updating the set of facts that are consistent with the currently available information.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Programming Languages

Died the same way β€” πŸ‘» Ghosted