Browsing by Author "DeWitt, David"
Now showing items 1-15 of 15
-
Adaptive and Robust Query Processing with SHARP
Bizarro, Pedro; DeWitt, David (University of Wisconsin-Madison Department of Computer Sciences, 2006)Database catalogs often do not contain enough statistical information to correctly cost all possible physi-cal plans. In their absence, the optimizer can produce incorrect estimates and select suboptimal plans for execution. ... -
Application of Abstract Data Types to the Implementation of Data Base Management Systems
Baroody, Anthony; DeWitt, David (University of Wisconsin-Madison Department of Computer Sciences, 1977)This research describes the use of abstract data types as a design and implementation tool for data base management systems. Abstract data types, represented by generic objects and generic procedures, are used to implement ... -
Clone Join and Shadow Join: Two Parallel Algorithms for Executing Spatial Join Operations
Patel, Jignesh; DeWitt, David (University of Wisconsin-Madison Department of Computer Sciences, 1999) -
Content-Based Routing for Continuous Query-Optimization
Bizarro, Pedro; Babu, Shivnath; DeWitt, David; Widom, Jennifer (University of Wisconsin-Madison Department of Computer Sciences, 2004)Current Data Stream Management Systems do not fully exploit their adaptive nature to handle complex queries. To date, such systems route stream tuples to operators or operator paths based only on operator-level statistics. ... -
Database Support for Matching: Limitations and Opportunities
Kini, Ameet; Shankar, Srinath; DeWitt, David; Naughton, Jeffrey (University of Wisconsin-Madison Department of Computer Sciences, 2005)A match join of R and S with predicate theta is a subset of the theta join of R and S such that each tuple of R and S contributes to at most one result tuple. Match joins and their generalizations arise in many scenarios, ... -
DBMSs On Modern Processors: Where does time go?
Ailamaki, Anastassia; DeWitt, David; Hill, Mark; Wood, David (University of Wisconsin-Madison Department of Computer Sciences, 1999) -
Design Considerations for Data Flow Database Machines
Boral, Haran; DeWitt, David (University of Wisconsin-Madison Department of Computer Sciences, 1979) -
Direct - A Distributed Computer Architecture for Supporting Relational Data Base Management Systems
DeWitt, David (University of Wisconsin-Madison Department of Computer Sciences, 1977)The design of DIRECT, a distributed computer architecture for supporting relational data base management systems is presented. DIRECT has a MIMD (multiple instruction stream, multiple data stream) architecture. It can ... -
DIRECT: A Multiprocessor Organization for Supporting Relational Database Management Systems
DeWitt, David (University of Wisconsin-Madison Department of Computer Sciences, 1978)The design of DIRECT, a multiprocessor organization for supporting relational database management systems is presented. DIRECT has a MIMD (multiple instruction stream, multiple data stream) architecture. It can simultaneously ... -
A Framework for Research in Database Management for Statistical Analysis
Boral, Haran; DeWitt, David; Bates, Douglas M (University of Wisconsin-Madison Department of Computer Sciences, 1982) -
Implementation Techniques for Main Memory Database Systems
DeWitt, David; Katz, Randy H.; Olken, Frank; Shapiro, Leonard D.; Stonebraker, Michael R.; Wood, David A. (University of Wisconsin-Madison Department of Computer Sciences, 1984) -
Integrated Concurrency Control and Recovery Mechanisms: Design and Performance Evaluation
Agrawal, Rakesh; DeWitt, David (University of Wisconsin-Madison Department of Computer Sciences, 1983) -
Processor Allocation Strategies for Multiprocessor Database Machines
Boral, Haran; DeWitt, David (University of Wisconsin-Madison Department of Computer Sciences, 1979) -
Query Execution in Direct
DeWitt, David (University of Wisconsin-Madison Department of Computer Sciences, 1978)In this paper query organization, execution,and optimization in the database machine DIRECT are discussed. We demonstrate that the use of a monitor for each relation referenced by a query along with the use of the NEXT-PAGE ... -
Scalable Anonymization Algorithms for Large Data Sets
LeFevre, Kristen; DeWitt, David (University of Wisconsin-Madison Department of Computer Sciences, 2007)k-Anonymity is a widely-studied mechanism for protecting identity when distributing non-aggregate personal data. This basic mechanism can also be extended to protect an individual-level sensitive attribute. Numerous ...