Towards a general theory of action and time
Artificial Intelligence
Database system concepts
Evidential support logic programming
Fuzzy Sets and Systems
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
The design and analysis of spatial data structures
The design and analysis of spatial data structures
A logic for reasoning about probabilities
Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
New direction for uncertainty reasoning in deductive databases
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Probabilistic logic programming
Information and Computation
Stable semantics for probabilistic deductive databases
Information and Computation
Database models for infinite and indefinite temporal information
Information Systems
Probabilistic deductive databases
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
A probabilistic relational model and algebra
ACM Transactions on Database Systems (TODS)
Advanced database systems
ProbView: a flexible probabilistic database system
ACM Transactions on Database Systems (TODS)
Representing and integrating multiple calendars
Representing and integrating multiple calendars
Principles of multimedia database systems
Principles of multimedia database systems
Supporting valid-time indeterminacy
ACM Transactions on Database Systems (TODS)
The Management of Probabilistic Data
IEEE Transactions on Knowledge and Data Engineering
A Parametric Approach to Deductive Databases with Uncertainty
IEEE Transactions on Knowledge and Data Engineering
Database Support for Problematic Knowledge
EDBT '92 Proceedings of the 3rd International Conference on Extending Database Technology: Advances in Database Technology
Generalized Events In Temporal Databases
Proceedings of the Fifth International Conference on Data Engineering
The Theory of Probabilistic Databases
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Incomplete Information in Relational Temporal Databases
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Extending Temporal Relational Databases to Deal with Imprecise and Qualitative Temporal Information
Proceedings of the International Workshop on Temporal Databases: Recent Advances in Temporal Databases
Modeling Uncertainty in Deductive Databases
DEXA '94 Proceedings of the 5th International Conference on Database and Expert Systems Applications
Monitoring distributed systems: a relational approach
Monitoring distributed systems: a relational approach
ISMIS '02 Proceedings of the 13th International Symposium on Foundations of Intelligent Systems
Providing Contextual Information to Pervasive Computing Applications
PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
When plans distinguish Bayes nets
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Aggregate operators in probabilistic databases
Journal of the ACM (JACM)
A Logical Formulation of Probabilistic Spatial Databases
IEEE Transactions on Knowledge and Data Engineering
Exploiting data correlation for multi-scale processing in sensor networks
Proceedings of the 2nd international conference on Scalable information systems
Event queries on correlated probabilistic streams
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Cascadia: A System for Specifying, Detecting, and Managing RFID Events
Proceedings of the 6th international conference on Mobile systems, applications, and services
Representation of factual and temporal unawareness in electronic patient records
Journal of Computational Methods in Sciences and Engineering
Aggregates in Generalized Temporally Indeterminate Databases
SUM '07 Proceedings of the 1st international conference on Scalable Uncertainty Management
"Same, Same but Different" A Survey on Duplicate Detection Methods for Situation Awareness
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part II
ACOS'06 Proceedings of the 5th WSEAS international conference on Applied computer science
On uncertainty and data-warehouse design
ADVIS'04 Proceedings of the Third international conference on Advances in Information Systems
IO3: interval-based out-of-order event processing in pervasive computing
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
Ontology-Based user context management: the challenges of imperfection and time-dependence
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part I
AN EFFICIENT REPRESENTATION MODEL OF DISTANCE DISTRIBUTION BETWEEN UNCERTAIN OBJECTS
Computational Intelligence
A temporal-probabilistic database model for information extraction
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
Dyreson and Snodgrass have drawn attention to the fact that, in many temporal database applications, there is often uncertainty about the start time of events, the end time of events, and the duration of events. When the granularity of time is small (e.g., milliseconds), a statement such as “Packet p was shipped sometime during the first 5 days of January, 1998” leads to a massive amount of uncertainty (5×24×60×60×1000) possibilities. As noted in Zaniolo et al. [1997], past attempts to deal with uncertainty in databases have been restricted to relatively small amounts of uncertainty in attributes. Dyreson and Snodgrass have taken an important first step towards solving this problem.In this article, we first introduce the syntax of Temporal-Probabilistic (TP) relations and then show how they can be converted to an explicit, significantly more space-consuming form, called Annotated Relations. We then present a theoretical annotated temporal algebra (TATA). Being explicit, TATA is convenient for specifying how the algebraic operations should behave, but is impractical to use because annotated relations are overwhelmingly large.Next, we present a temporal probabilistic algebra (TPA). We show that our definition of the TP-algebra provides a correct implementation of TATA despite the fact that it operates on implicit, succinct TP-relations instead of overwhemingly large annotated relations. Finally, we report on timings for an implementation of the TP-Algebra built on top of ODBC.