Parag Agrawal
Jennifer Widom
- {1} O. Benjelloun, A. Das Sarma, A. Halevy, and J. Widom. ULDBs: Databases with uncertainty and lineage. In Proc. of Intl. Conference on Very Large Databases (VLDB), September 2006. Google Scholar
Digital Library
- {2} O. Benjelloun, A. Das Sarma, C. Hayworth, and J. Widom. An introduction to ULDBs and the Trio system. IEEE Data Engineering Bulletin, Special Issue on Probabilistic Databases, 29(1):5-16, March 2006.Google Scholar
- {3} A. Das Sarma, O. Benjelloun, A. Halevy, and J. Widom. Working models for uncertain data. In Proc. of Intl. Conference on Data Engineering (ICDE), April 2006. Google ScholarDigital Library
- {4} A. Das Sarma, S.U. Nabar, and J. Widom. Representing uncertain data: Uniqueness, equivalence, minimization, and approximation. Technical report, Stanford InfoLab, December 2005. Available at http://dbpubs.stanford.edu/pub/2005-38.Google Scholar
- {5} J. Widom. Trio: A system for integrated management of data, accuracy, and lineage. In Proc. of Conference on Innovative Data Systems Research (CIDR), 2005.Google Scholar
Index Terms
- Trio: a system for data, uncertainty, and lineage
Recommendations
Research on Data Uncertainty and Lineage Through Trio
WSSE '19: Proceedings of the 1st World Symposium on Software EngineeringIt is an indisputable fact that the amount of data has grown exponentially, and the resulting uncertainty of data has become more and more common in recent years, which has brought many negative effects to our life and scientific research. Through ...
On stateless multihead automata: Hierarchies and the emptiness problem
We look at stateless multihead finite automata in their two-way and one-way, deterministic and nondeterministic variations. The transition of a k-head automaton depends solely on the symbols currently scanned by its k heads, and every such transition ...
Pebble alternating tree-walking automata and their recognizing power
Pebble tree-walking automata with alternation were first investigated by Milo, Suciu and Vianu (2003), who showed that tree languages recognized by these devices are exactly the regular tree languages. We strengthen this by proving the same result for ...
Comments