Browsing by Author "Ramakrishnan, Raghu"
Now showing items 29-37 of 37
-
Scalable Integration of Data Collections on the Web
Ramakrishnan, Raghu; Silberschatz, Avi (University of Wisconsin-Madison Department of Computer Sciences, 1998) -
Schema Intension Graphs: A Formal Model for the Study of Schema Equivalence
Miller, Renee J; Ioannidis, Yannis E; Ramakrishnan, Raghu (University of Wisconsin-Madison Department of Computer Sciences, 1994) -
SEQ: Design and Implementation of a Sequence Database System
Seshadri, Praveen; Livny, Miron; Ramakrishnan, Raghu (University of Wisconsin-Madison Department of Computer Sciences, 1996) -
SLIC: On-The-Fly Extraction and Querying of Web Data
McCann, Robert; DeRose, Pedro; Doan, AnHai; Ramakrishnan, Raghu (University of Wisconsin-Madison Department of Computer Sciences, 2006)Increasingly, Web data is displayed in pages generated according to a template (e.g., product listings at amazon.com, faculty directories, class schedules). This trend makes structured querying of such Web data a valuable ... -
Source-Aware Entity Matching: A Compositional Approach
Shen, Warren; DeRose, Pedro; Vu, Long; Doan, AnHai; Ramakrishnan, Raghu (University of Wisconsin-Madison Department of Computer Sciences, 2006)Entity matching (a.k.a. record linkage) plays a crucial role in integrating multiple data sources, and numerous matching solutions have been developed. However, the solutions have largely exploited only information available ... -
Space Optimization in Deductive Databases
Srivastava, Divesh; Sudarshan, S; Ramakrishnan, Raghu; Naughton, Jeffrey F (University of Wisconsin-Madison Department of Computer Sciences, 1991) -
A Unified Approach to Logic Program Evaluation
Naughton, Jeffrey F; Ramakrishnan, Raghu (University of Wisconsin-Madison Department of Computer Sciences, 1989)The Prolog evaluation algorithm has become the standard for logic program evaluation, and bottom-up methods have long been considered impractical because they compute irrelevant facts. Recently, however, bottom-up evaluation ... -
Using Constraints to Query R* -Trees
Goldstein, Jonathan; Ramakrishnan, Raghu; Shaft, Uri; Yu, Jie-Bing (University of Wisconsin-Madison Department of Computer Sciences, 1996) -
When Is Nearest Neighbor Meaningful?
Beyer, Kevin; Goldstein, Jonathan; Ramakrishnan, Raghu; Shaft, Uri (University of Wisconsin-Madison Department of Computer Sciences, 1998)