Browsing by Author "Ramakrishnan, Raghu"
Now showing items 4-23 of 37
-
Caching with "Good Enough" Currency, Consistency, and Completeness
Guo, Hongfei; Larson, Per-Ake; Ramakrishnan, Raghu (University of Wisconsin-Madison Department of Computer Sciences, 2004)SQL extensions that allow queries to explicitly specify data quality requirements in terms of currency and consistency were proposed in an earlier paper. This paper develops a data quality-aware, finer grained cache model ... -
The Case for Enhanced Abstract Data Types
Seshadri, Praveen; Livny, Miron; Ramakrishnan, Raghu (University of Wisconsin-Madison Department of Computer Sciences, 1996) -
Compressing Relations and Indexes
Goldstein, Jonathan; Ramakrishnan, Raghu; Shaft, Uri (University of Wisconsin-Madison Department of Computer Sciences, 1997) -
Computation of Multidimensional Aggregates
Deshpande, Prasad M; Agarwal, Sameet; Naughton, Jeffrey F; Ramakrishnan, Raghu (University of Wisconsin-Madison Department of Computer Sciences, 1997) -
Content-Based Queries in Image Databases
Shaft, Uri; Ramakrishnan, Raghu (University of Wisconsin-Madison Department of Computer Sciences, 1996) -
Deja Vu in Fixpoints of Logic Programs
Maher, Michael J; Ramakrishnan, Raghu (University of Wisconsin-Madison Department of Computer Sciences, 1989)We investigate properties of logic programs that permit refinements in their fixpoint evaluation and shed light on the choice of control strategy. A fundamental aspect of a bottom-up computation is that we must constantly ... -
Dynamic Histograms: Capturing Evolving Data Sets
Donjerkovic, Donko; Ioannidis, Yannis; Ramakrishnan, Raghu (University of Wisconsin-Madison Department of Computer Sciences, 1999) -
Efficient Transitive Closure Algorithms
Ioannidis, Yannis E; Ramakrishnan, Raghu (University of Wisconsin-Madison Department of Computer Sciences, 1988) -
Filter Joins: Cost-Based Optimization for Magic Sets
Seshadri, Praveen; Hellerstein, Joseph M; Ramakrishnan, Raghu (University of Wisconsin-Madison Department of Computer Sciences, 1995) -
A Framework for Testing Safety and Effective Computability of Extended Datalog
Krishnamurthy, Ravi; Ramakrishnan, Raghu; Shmueli, Oded (University of Wisconsin-Madison Department of Computer Sciences, 1988) -
Generalized Containment of Conjunctive Queries
Ioannidis, Yannis E; Ramakrishnan, Raghu (University of Wisconsin-Madison Department of Computer Sciences, 1992) -
Histogram Guided Interactive Query Evaluation
Donjerkovic, Donko; Ramakrishnan, Raghu (University of Wisconsin-Madison Department of Computer Sciences, 2000) -
Multidimensional K-Anonymity
LeFevre, Kristen; DeWitt, David J.; Ramakrishnan, Raghu (University of Wisconsin-Madison Department of Computer Sciences, 2005)K-Anonymity has been proposed as a mechanism for privacy protection in microdata publishing, and numerous recoding ?models? have been considered for achieving kanonymity. This paper proposes a new multidimensional model, ... -
OLAP over Imprecise Data With Domain Constraints
Burdick, Doug; Doan, AnHai; Ramakrishnan, Raghu; Vaithyanathan, Shivakumar (University of Wisconsin-Madison Department of Computer Sciences, 2007)Several recent works have focused on OLAP over imprecise data, where each fact can be a region, instead of a point, in a multi-dimensional space. They have provided a multiple-world semantics for such data, and ... -
On the Integration of Structure Indexes and Inverted Lists
Kaushik, Raghav; Krishnamurthy, Rajasekar; Naughton, Jeffrey; Ramakrishnan, Raghu (University of Wisconsin-Madison Department of Computer Sciences, 2003)We consider the problem of how to combine structure indexes and inverted lists to answer queries over a native XML DBMS, where the queries specify both path and keyword constraints. We augment the inverted list entries to ... -
On the Power of Magic
Beeri, Catriel; Ramakrishnan, Raghu (University of Wisconsin-Madison Department of Computer Sciences, 1988) -
Optimizing Existential Datalog Queries
Ramakrishnan, Raghu; Beeri, Catriel; Krishnamurthy, Ravi (University of Wisconsin-Madison Department of Computer Sciences, 1988) -
Optimizing MPF Queries: Decision Support and Probabilistic Inference
Bravo, Hector Corrada; Ramakrishnan, Raghu (University of Wisconsin-Madison Department of Computer Sciences, 2006)We identify a broad class of aggregate queries, called MPF queries, inspired by the literature on marginalizing product functions. MPF queries operate on �functional relations,� where a measure attribute is functionally ... -
Parallelism in Logic Programs
Ramakrishnan, Raghu (University of Wisconsin-Madison Department of Computer Sciences, 1989)There is a tension between the objectives of avoiding irrelevant computation and extracting parallelism, in that a computational step used to restrict another must precede the latter. Our thesis, following [BeR87], is ... -
Privacy Skyline: Privacy with Multidimensional Adversarial Knowledge
Chen, Bee-Chung; LeFevre, Kristen; Ramakrishnan, Raghu (University of Wisconsin-Madison Department of Computer Sciences, 2007)Privacy is an important issue in data publishing. Many organizations distribute non-aggregate personal data for research, and they must take steps to ensure that an adversary cannot predict sensitive information pertaining ...