BENCBMARKING DATABASE SYSTEMS A SYSTEMATIC APPROACH (2009)
Dina Bitton, David J. Dewitt, Carolyn Turbyfill
This paper describes a customized database and a comprehensive set of queries that can be used for systematic benchmarking of relational database systems. Designing this database and a set of...
Shahram Ghandeharizadeh, David J. Dewitt
ABSTRACT- In shared-nothing multiprocessor database machines, the relational operators that form a query are executed on the processors where the relations they reference are stored. In general, as...
Clustera: An Integrated Computation And Data Management System (2009)
David J. Dewitt, Erik Paulson, Eric Robinson, Jeffrey Naughton, Joshua Royalty, Srinath Shankar, ...
This paper introduces Clustera, an integrated computation and data management system. In contrast to traditional clustermanagement systems that target specific types of workloads, Clustera is...
Read-Optimized Databases, In Depth (2009)
Allison L. Holloway, David J. Dewitt
Recently, a number of papers have been published showing the benefits of column stores over row stores. However, the research comparing the two in an “apples-to-apples ” way has left a number of...
Stratis D. Viglas, Leonidas Galanis, David J. Dewitt, Jeffrey F. Naughton, David Maier
While the XML community appears to be converging on XQuery as a standard for querying XML documents, there is currently much less consensus about a standard algebra. In this paper, we describe the...
Adaptive and Robust Query Processing with (2008)
Pedro Bizarro, David J. Dewitt
Database catalogs often do not contain enough statistical information to correctly cost all possible physical plans. In their absence, the optimizer can produce incorrect estimates and select...
Introduction Chapter 14 Storage Management for Objects in EXODUS (2008)
Michael J. Carey, David J. Dewitt, Joel E. Richardson, Eugene J. Shekita
In the 1970’s, the relational data model was the focus of much of the research in the database area.
Anastassia G. Ailamaki, David J. Dewitt, Mark D. Hill, David A. Wood
Recent high-performance processors employ sophisticated techniques to overlap and simultaneously execute multiple computation and memory operations. Intuitively, these techniques should help database...
DataSplash: A Direct Manipulation Environment for Programming Semantic Zoom Visualizations of (2008)
Phd Computer Science, Expected Summer, Advisors Raghu Ramakrishnan, Vuk Ercegovac, David J. Dewitt, Raghu Ramakrishnan, ...
Combining text retrieval with RDBMS: Database design, retrieval models, performance evaluation. Query processing: Indexing, top-k query processing, text retrieval, algorithms, partial indexing. Data...
workstation-server model of computing is emerging as the stan-dard of the 1990s. Implementing an object-oriented database sys-tem in this environment immediately presents the design choice of how to...
ABSTRACT Incognito: Efficient Full-Domain K-Anonymity (2008)
Kristen Lefevre, David J. Dewitt, Raghu Ramakrishnan
A number of organizations publish microdata for purposes such as public health and demographic research. Although attributes that clearly identify individuals, such as Name and Social Security...
The TEXTURE Benchmark: Measuring Performance of Text Queries on a Relational DBMS (2008)
Vuk Ercegovac, David J. Dewitt, Raghu Ramakrishnan
We introduce a benchmark called TEXTURE (TEXT Under RElations) to measure the relative strengths and weaknesses of combining text processing with a relational workload in an RDBMS. While the...
GAMMA- A High I’erf’ormnnrc II:ltsflow Database Machine (2008)
David J. Dewitt, Roberl H. Gerber, Goetr Graefe, Michael L. Heyrens, Krishna B. Kumar, M. Muralikrishna
In this paper, we present tie design, implementation techniques, and initial performance evaluation of Gamma. Gamma is a new rela-tional database machine that exploits dataflow query processing...
Abstract Integrating databases and workflow systems (2008)
Srinath Shankar, Ameet Kini, David J Dewitt, Jeffrey Naughton
There has been an information explosion in fields of science such as high energy physics, astronomy, environmental sciences and biology. There is a critical need for automated systems to manage...
ABSTRACT Incognito: Efficient Full-Domain K-Anonymity (2008)
Kristen Lefevre, David J. Dewitt, Raghu Ramakrishnan
A number of organizations publish microdata for purposes such as public health and demographic research. Although attributes that clearly identify individuals, such as Name and Social Security...
Kristen Lefevre, David J. Dewitt, Parul Halwe, Vibhooti Verma
● A number of organizations publish micro data for purposes such as public health and demographic research. ● It might lead to violation of data privacy of some individual....
Workload-aware Anonymization, Kristen Lefevre, David J. Dewitt, Raghu Ramakrishnan
Protecting data privacy is an important problem in microdata distribution. Anonymization algorithms typically aim to protect individual privacy, with minimal impact on the quality of the resulting...
Leonidas Galanis, Yuan Wang, Shawn R. Jeffrey, David J. Dewitt, Rolando Blanco, Cs Winter, ...
- Finds xml files relevant to a query
Topics: Internet and WWW (2008)
In this paper, we design and evaluate an efficient and dynamic regrouping approach to optimize a large continuous query workload. The key idea of our regrouping algorithm is to find a best solution...
Optimization and performance Contact Author: (2008)
Feng Tian, David J. Dewitt, Feng Tian
One approach to building an efficient XML query processor is to use a relational database system to store and query XML documents. However, XQuery contains a number of features that are either hard...
Anastassia Ailamaki ‡ Weaving Relations for Cache Performance (2008)
David J. Dewitt, Mark D. Hill, Marios Skounakis
Relational database systems have traditionally optimzed for I/O performance and organized records sequentially on disk pages using the N-ary Storage Model (NSM) (a.k.a., slotted pages). Recent...
The focus of the Paradise project is to design and implement a scaleable database system capable of stor-ing and processing massive data sets such as those produced by NASA's EOSDIS project....
1 Parallel Database Systems: The Future of High Performance Database Processing (2007)
Abstract: Parallel database machine architectures have evolved from the use of exotic hardware to a software parallel dataflow architecture based on conventional shared-nothing hardware. These new...
(e ciency and e ectiveness) (2007)
Spatial applications frequently need to join two data sets based on some spatial relationship between objects in the two data sets. This operation, called a spatial join, is an expensive operation...
Abstract The Design and Performance Evaluation of Alternative XML Storage Strategies (2007)
Feng Tian, Feng Tian, Feng Tian, David J. Dewitt, David J. Dewitt, Jianjun Chen, ...
XML is an emerging Internet standard for data representation and exchange. When used in conjunction with a DTD (Document Type Definition), XML permits the execution of a rich collection of queries...
Anastassia Ailamaki, David J. Dewitt, Mark D. Hill
{dewitt, markhill} @ cs. wisc. edu Relational database systems have traditionally optimized for I/0 performance and organized records sequentially on disk pages using the N-ary Storage Model (NSM)...
Anastassia Ailamaki ‡ Weaving Relations for Cache Performance (2007)
David J. Dewitt, Mark D. Hill, Marios Skounakis
Relational database systems have traditionally optimzed for I/O performance and organized records sequentially on disk pages using the N-ary Storage Model (NSM) (a.k.a., slotted pages). Recent...
S. Cluet, S. Jacqmin, and J. Simeon. "The New YATL: Design and Specifications (2007)
World Wide Web, S. Cluet, S. Jacqmin, Igor Tatarinov, Zachary G. Ives, Alon Y. Halevy, ...
IGMOD Conference, 2000. 114 [37] E. S. Cohen, D. A. Soni, R. Gluecker, W. M. Hasling, R. W. Schwanke and M. E. Wagner. "Version Management in Gypsy", ACM SIGSOFT/SIGPLAN Software...
Materialization strategies in a column-oriented dbms (2007)
David J. Dewitt, Samuel R. Madden, Daniel J. Abadi, Daniel J. Abadi, Daniel S. Myers, Daniel S. Myers
This material is posted here with permission of the IEEE. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional...
Materialization Strategies in a Column-Oriented DBMS (2006)
Abadi, Daniel J., Myers, Daniel S., DeWitt, David J., Madden, Samuel R.
There has been renewed interest in column-oriented database architectures in recent years. For read-mostly query workloads such as those found in data warehouse and decision support applications,...
Materialization Strategies in a Column-Oriented DBMS (2006)
Abadi, Daniel J., Myers, Daniel S., DeWitt, David J., Madden, Samuel R.
There has been renewed interest in column-oriented database architectures in recent years. For read-mostly query workloads such as those found in data warehouse and decision support applications,...
Database support for matching: limitations and opportunities (2006)
Ameet Kini, Srinath Shankar, Jeffrey F. Naughton, David J. Dewitt
We define a match join of R and S with predicate θ to be a subset of the θ-join of R and S such that each tuple of R and S contributes to at most one result tuple. Match joins and their...
Database support for matching: limitations and opportunities (2006)
Ameet Kini, Srinath Shankar, Jeffrey F. Naughton, David J. Dewitt
We define a match join of R and S with predicate θ to be a subset of the θ-join of R and S such that each tuple of R and S contributes to at most one result tuple. Match joins and their...
Mondrian multidimensional k-anonymity (2006)
Kristen Lefevre, David J. Dewitt, Raghu Ramakrishnan
K-Anonymity has been proposed as a mechanism for protecting privacy in microdata publishing, and numerous recoding “models ” have been considered for achieving kanonymity. This paper proposes a...
The TEXTURE Benchmark: Measuring Performance of (2005)
Text Queries On, Vuk Ercegovac, David J. Dewitt, Raghu Ramakrishnan
We introduce a benchmark called TEXTURE (TEXT Under RElations) to measure the relative strengths and weaknesses of combining text processing with a relational workload in an RDBMS. While the...
The Lowell Database Research Self-Assessment (2005)
Abiteboul, Serge, Agrawal, Rakesh, Bernstein, Philip A., Carey, Michael J., Ceri, Stefano, Croft, W. Bruce, ...
Database needs are changing, driven by the Internet and increasing amounts of scientific and sensor data. In this article, the authors propose research into several important new directions for...
Rethinking the Conference Reviewing Process - Panel (2004)
Franklin,Michael J., Widom,Jennifer, Weikum,Gerhard, Bernstein,Philip A., Halevy,Alon, DeWitt,David J., ...
Rethinking the Conference Reviewing Process - Panel (2004)
Franklin, Michael J., Widom, Jennifer, Weikum, Gerhard, Bernstein, Philip A., Halevy, Alon, DeWitt, David J., ...
Rethinking the Conference Reviewing Process - Panel (2004)
Franklin, Michael J., Widom, Jennifer, Weikum, Gerhard, Bernstein, Philip A., Halevy, Alon Y., DeWitt, David J., ...
Computing PageRank in a Distributed Internet Search System (2004)
Yuan Wang David, David J. Dewitt
Existing Internet search engines use web crawlers to download data from the Web. Page quality is measured on central servers, where user queries are also processed. This paper argues that using...
Rethinking the Conference Reviewing Process - Panel (2004)
Franklin, Michael J., Widom, Jennifer, Weikum, Gerhard, Bernstein, Philip A., Halevy, Alon, DeWitt, David J., ...
Processing Queries in a Large Peer-to-Peer System (2003)
Leonidas Galanis, Yuan Wang, Shawn R. Jeffery, David J. Dewitt
Abstract. While current search engines seem to easily handle the size of the data available on the Internet, they cannot provide fresh results. The most up-to-date data always resides on the data...
Locating data sources in large distributed systems (2003)
Leonidas Galanis, Yuan Wang, Shawn R. Jeffery, David J. Dewitt
Querying large numbers of data sources is gaining importance due to increasing numbers of independent data providers. One of the key challenges is executing queries on all relevant information...
Processing Queries in a Large Peer-to-Peer System (2003)
Leonidas Galanis, Yuan Wang, Shawn R. Jeffery, David J. Dewitt
Abstract. While current search engines seem to easily handle the size of the data available on the Internet, they cannot provide fresh results. The most up-to-date data always resides on the data...
Locating data sources in large distributed systems (2003)
Leonidas Galanis, Yuan Wang, Shawn R. Jeffery, David J. Dewitt
Querying large numbers of data sources is gaining importance due to increasing numbers of independent data providers. One of the key challenges is executing queries on all relevant information...
Mixed mode xml query processing (2003)
Alan Halverson, Josef Burger, Leonidas Galanis, Ameet Kini, Rajasekar Krishnamurthy, Ajith Nagaraja Rao, ...
Querying XML documents typically involves both tree-based navigation and pattern matching similar to that used in structured information retrieval domains. In this paper, we show that for good...
Semantically-Smart Disk Systems (2003)
David J. Dewitt, Mark D. Hill, Mikko H. Lipasti, Muthian Sivathanu, Muthian Sivathanu
ii
The Design and Implementation of a Database Management System Using Abstract Data Type. (2002)
The design, implementation, and performance analysis of a database management system implemented using abstract data types are presented. The use of abstract data types as an implementation tool is...
Design Considerations for Data-Flow Database Machines. (2002)
This paper presents a discussion of the application of data-flow machine concepts to the design and implementation of database machines which execute relational algebra queries. We analyze the...
Processor Allocation Strategies for Multiprocessor Database Machines, (2002)
Sponsored in part by grant NSF-MCS78-01721.
Performance Analysis of Alternative Database Machine Architectures. (2002)
Hawthorn,Paula B., DeWitt,David J.
The rapid advances in the development of low-cost computer hardware have led to many proposals for the use of this hardware to improve the performance of database management systems. Usually the...
Processor Allocation Strategies for Multiprocessor Database Machines, (2002)
Boral, Haran, DeWitt, David J.
In this paper we describe and evaluate four alternative strategies for assigning processors to queries in multiprocessor database machines. Our results demonstrate that SIMD database machines are...
Duplicate Record Elimination in Large Data Files. (2002)
Friedland,Dina, DeWitt,David J.
This paper addresses the issue of duplicate elimination in large data files in which many occurrences of the same record may appear. A comprehensive cost analysis of the duplicate elimination...
A Performance Evaluation of Database Machine Architectures. (2002)
DeWitt,David J., Hawthorn,Paula B.
The rapid advances in the development of low-cost computer hardware have led to many proposals for the use of this hardware to improve the performance of database management systems. Usually the...
Implementation of the Database Machine DIRECT. (2002)
Boral,Haran, DeWitt,David J., Friedland,Dina, Jarrell,Nancy F., Wilkinson,W. Kevin
DIRECT is a multiprocessor database machine designed and implemented at the University of Wisconsin. This paper describes our experiences with the implementation of DIRECT. We start with a brief...
Implementation Techniques for Main Memory Database Systems. (2002)
DeWitt,David J., Katz,Randy H., Olken,Frank, Shapiro,Leonard D., Stonebraker,Michael R.
With the availability of very large, relatively inexpensive main memories, it is becoming possible to keep large databases resident in main memory. This paper considers the changes necessary to...
A Case for Fractured Mirrors (2002)
Ravishankar Ramamurthy, David J. Dewitt, Qi Su
The Decomposition Storage Model (DSM) vertically partitions all attributes of a given relation. DSM has excellent I/O behavior when the number of attributes touched in the query is small. It also has...
The Design and Performance Evaluation of Alternative XML Storage Strategies (2002)
Feng Tian, Feng Tian, Feng Tian, David J. Dewitt, David J. Dewitt, Jianjun Chen, ...
Topics: Databases and database services in new context- Internet and the WWW Semi-structured data Database benchmark and measurement
Jianjun Chen, David J. DeWitt, Jeffrey F. Naughton
selection placement strategies for optimizing a very large number of continuous queries in an Internet environment. Two grouping strategies, PushDown and PullUp, in which selections are either pushed...
Data Page Layouts for Relational Databases on Deep Memory Hierarchies (2002)
Anastassia Ailamaki, David J. Dewitt, Mark D. Hill
Relational database systems have traditionally optimized for I/O performance and organized records sequentially on disk pages using the N-ary Storage Model (NSM) (a.k.a., slotted pages). Recent...
The Design and Performance Evaluation of Alternative XML Storage Strategies (2002)
Feng Tian, David J. Dewitt, Jianjun Chen, Chun Zhang
This paper studies five strategies for storing XML documents including one that leaves documents in the file system, three that use a relational database system, and one that uses an object manager....
Data Page Layouts for Relational Databases (2002)
On Deep Memory, Anastassia Ailamaki, David J. Dewitt, Mark D. Hill
Relational database systems have traditionally optimized for I/O performance and organized records sequentially on disk pages using the N-ary Storage Model (NSM) (a.k.a., slotted pages).
Weaving Relations for Cache Performance (2001)
Ailamaki, Anastassia, DeWitt, David J., Hill, Mark D., Skounakis, Marios
Caching for Multi-dimensional Data Mining Queries (2001)
Prasad M. Deshpande, David J. Dewitt
Multi-dimensional data analysis and online analytical processing are standard querying techniques applied on today’s data warehouses. Data mining algorithms, on the other hand, are still mostly run...
Leonidas Galanis, David J. Dewitt
Abstract. Computing aggregates over distributed data sets constitutes an interesting class of distributed queries. Recent advances in peer-to-peer discovery of data sources and query processing...
NiagaraCQ: A Scalable Continuous Query System for Internet Databases (2000)
Jianjun Chen, David J. Dewitt, Feng Tian, Yuan Wang
Continuous queries are persistent queries that allow users to receive new results when they become available. While continuous query systems can transform a passive web into an active environment,...
NiagaraCQ: A Scalable Continuous Query System for Internet Databases (2000)
Jianjun Chen, David J. DeWitt, Feng Tian, Yuan Wang
Continuous queries are persistent queries that allow users to receive new results when they become available. While continuous query systems can transform a passive web into an active environment,...
NiagaraCQ: A Scalable Continuous Query System for Internet Databases (2000)
Jianjun Chen, David J. Dewitt, Feng Tian, Yuan Wangcomputer
ABSTRACT Continuous queries are persistent queries that allow users toreceive new results when they become available. While
NiagaraCQ: A Scalable Continuous Query System for Internet Databases (2000)
Jianjun Chen, David J. Dewitt, Feng Tian, Yuan Wang
Continuous queries are persistent queries that allow users to receive new results when they become available. While continuous query systems can transform a passive web into an active environment,...
The Design and Performance Evaluation of Alternative XML Storage (2000)
Strategies Feng Tian, Feng Tian, David J. Dewitt, Jianjun Chen, Chun Zhang
This paper studies five strategies for storing XML documents including one that leaves documents in the file system, three that use a relational database system, and one that uses an object manager....
DBMSs on a Modern Processor: Where Does Time Go? (1999)
Ailamaki, Anastassia, DeWitt, David J., Hill, Mark D., Wood, David A.
DBMSs on a modern processor: Where does time go (1999)
Anastassia G. Ailamaki, David J. Dewitt, Mark D. Hill, David A. Wood
Recent high-performance processors employ sophisticated techniques to overlap and simultaneously execute multiple computation and memory operations. Intuitively, these techniques should help database...
OPT++: An Object-Oriented Implementation for Extensible Database Query Optimization (1999)
Paper Number 323 In this paper we describe the design and implementation of OPT++, a tool for Extensible Database Query Optimization that uses an object-oriented design to simplify the task of...
DBMSs on a modern processor: Where does time go (1999)
Anastassia Ailamaki, David J. Dewitt, Mark D. Hill, David A. Wood
Recent high-performance processors employ sophisticated techniques to overlap and simultaneously execute multiple computation and memory operations. Intuitively, these techniques should help database...
DBMSs On A Modern Processor: Where Does Time Go? (1999)
Anastassia Ailamaki David, David J. Dewitt, Mark D. Hill, David A. Wood
Recent high-performance processors employ sophisticated techniques to overlap and simultaneously execute multiple computation and memory operations. Intuitively, these techniques should help database...
Clone Join and Shadow Join: Two Parallel Algorithms for Executing Spatial Join Operations (1999)
Jignesh M. Patel, David J. DeWitt
With the growing popularity of spatial applications, there has been a significant increase in the use of database systems for storing and querying spatial data. Spatial data is now readily available...
DBMSs on modern processors: Where does time go? (1999)
Anastassia Ailamaki David, David J. Dewitt, Mark D. Hill, David A. Wood
this paper we answer the question "Where does time go when a database system executes on a modern computer platform?" We examine four commercial DBMSs running on an Intel Xeon and NT 4.0....
DBMSs on modern processors: Where does time go? (1999)
Anastassia Ailamaki, David J. DeWitt, Mark D. Hill, David A. Wood
this paper we answer the question "Where does time go when a database system executes on a modern computer platform?" We examine four commercial DBMSs running on an Intel Xeon and NT 4.0....
DBMSs On A Modern Processor: Where Does Time Go? (1999)
Anastassia Ailamaki, David J. DeWitt, Mark D. Hill, David A. Wood
Recent high-performance processors employ sophisticated techniques to overlap and simultaneously execute multiple computation and memory operations. Intuitively, these techniques should help database...
DBMSs On A Modern Processor: Where Does Time Go? (1999)
Anastassia Ailamaki David, David J. Dewitt, Mark D. Hill, David A. Wood
Recent high-performance processors employ sophisticated techniques to overlap and simultaneously execute multiple computation and memory operations. Intuitively, these techniques should help database...
DBMSs On A Modern Processor: Where Does Time Go? (1999)
Anastassia Ailamaki David, David J. Dewitt, Mark D. Hill, David A. Wood
Recent high-performance processors employ sophisticated techniques to overlap and simultaneously execute multiple computation and memory operations. Intuitively, these techniques should help database...
DBMSs On A Modern Processor: Where Does Time Go? (1999)
Anastassia Ailamaki David, David J. Dewitt, Mark D. Hill, David A. Wood
Recent high-performance processors employ sophisticated techniques to overlap and simultaneously execute multiple computation and memory operations. Intuitively, these techniques should help database...
A Survey of Parallel Sorting Algorithms. (1998)
DeWitt,David J., Friedland,Dina, Hsiao,David K., Menon,M. Jaishankar
A rather comprehensive survey of parallel sorting algorithms is included herein. Parallel sorting algorithms are considered in two major categories - the internal parallel sorting algorithms and the...
Extensible Database Systems. (1998)
DeWitt, David J., Carey, Michael J., Solomon, Marvin H.
Until recently, research and development efforts in the database management systems area were focused on supporting traditional business applications. The design of database systems capable of...
The Gamma Database Machine Project. (1998)
DeWitt, David J., Ghandeharizadeh, Shahram, Schneider, Donovan, Bricker, Allan, Hsiao, Hui-I
This paper describes the design of the Gamma database machine and the techniques employed in its implementation. Gamma is a relational database machine currently operating on an Intel iPSC/2...
Memory Allocation Strategies for Complex Decision Support Queries (1998)
Biswadeep Nag, David J. DeWitt
Complex decision support queries, as exemplified by the TPC-D benchmark, make heavy use of join, aggregation and sorting operations. These operations can be very memory intensive and it is unlikely...
The BUCKY Object-Relational Benchmark (1997)
Michael Carey David, David J. Dewitt, Jeffrey F. Naughton, Mohammad Asgarian, Paul Brown, Johannes E. Gehrke, ...
According to various trade journals and corporate marketing machines, we are now on the verge of a revolution--- the object-relational database revolution. Since we believe that no one should face a...
The BUCKY Object-Relational Benchmark (1997)
Michael J. Carey, David J. DeWitt, Jeffrey F. Naughton, Mohammad Asgarian, Paul Brown, Johannes E. Gehrke, ...
According to various trade journals and corporate marketing machines, we are now on the verge of a revolution -- the object-relational database revolution. Since we believe that no one should face a...
Of objects and databases: A decade of turmoil (1996)
Michael J. Carey, David J. Dewitt
A decade ago, the connection between objects and databases was new and was being explored in a number of di erent ways within our community. Driven by the perception that managing traditional...
Of objects and databases: A decade of turmoil (1996)
Michael J. Carey, David J. Dewitt
A decade ago, the connection between ob-jects and databases was new and was be-ing explored in a number of different ways within our community. Driven by the per-ception that managing traditional...
Of Objects and Databases: A Decade of Turmoil (1996)
Michael J. Carey, David J. DeWitt
A decade ago, the connection between objects and databases was new and was being explored in a number of different ways within our community. Driven by the perception that managing traditional...
Partition Based Spatial-Merge Join (1996)
Jignesh M. Patel, David J. DeWitt
This paper describes PBSM (Partition Based Spatial--Merge), a new algorithm for performing spatial join operation. This algorithm is especially effective when neither of the inputs to the join have...
Partition Based Spatial-Merge Join (1996)
Jignesh M. Patel, David J. DeWitt
This paper describes PBSM (Partition Based Spatial--Merge), a new algorithm for performing spatial join operation. This algorithm is especially effective when neither of the inputs to the join have...
this paper is how best to handle images stored on tape. We make the following assumptions:
Implementing Crash Recovery in QuickStore: A Performance Study (1995)
Seth J. White, David J. Dewitt
Implementing crash recovery in an Object-Oriented Database System (OODBMS) raises several challenging issues for performance that are not present in traditional DBMSs. These performance concerns...
Managing Intra-operator Parallelism in Parallel Database Systems (1995)
Int#ra-operator (or partitioned) parallelism is a well-established mechanism for achieving high performance in parallel database systems. However, the problem of how to exploit intra-operator...
QuickStore: A High Performance Mapped Object Store (1994)
Seth J. White, David J. Dewitt
This paper presents, QuickStore, a memory-mapped storage system for persistent C++ built on top of the EXODUS Storage Manager. QuickStore provides fast access to in-memory objects by allowing...
David J. Dewitt, Navin Kabra, Jun Luo, Jignesh M. Patel, Jie-bing Yu
This paper describes the design and implementation of Paradise, a database system designed for handling GIS type of applications. The current version of Paradise, uses a client{server architecture...
QVLDB QuickStore: A High Performance Mapped Object Store (1994)
Seth J. White, David J. Dewitt
Abstract. QuickStore is a memory-mapped storage system for persistent C+ +, built on top of the EXODUS Storage Manager. QuickStore provides fast access to in-memory objects by allowing application...
QuickStore: A High Performance Mapped Object Store (1994)
Seth J. White, David J. Dewitt
This paper presents, QuickStore, a memory-mapped storage system for persistent C++ built on top of the EXODUS Storage Manager. QuickStore provides fast access to in-memory objects by allowing...
Michael J. Carey, David J. DeWitt, Jeffrey F. Naughton
The OO7 Benchmark represents a comprehensive test of OODBMS performance. In this report we describe the benchmark and present performance results from its implementation in four OODB systems. It is...
A Status Report on the OO7 OODBMS Benchmarking Effort (1994)
Michael Carey David, David J. Dewitt, Chander Kant, Jeffrey F. Naughton
The OO7 Benchmark was first published in 1993, and has since found a home in the marketing literature of various object-oriented database management system (OODBMS) vendors. The OO7 Benchmark (as...
David J. DeWitt, Navin Kabra, Jun Luo, Jignesh M. Patel, Jie-bing Yu
This paper describes the design and implementation of Paradise, a database system designed for handling GIS type of applications. The current version of Paradise, uses a client--server architecture...
Data Placement in Shared-Nothing Parallel Database Systems (1994)
.<F3.733e+05> Data placement in shared-nothing database systems has been studied extensively in the past and various placement algorithms have been proposed. However, there is no consensus on...
Shoring Up Persistent Applications (1994)
Michael Carey David, David J. Dewitt, Nancy E. Hall, ...
SHORE (Scalable Heterogeneous Object REpository) is a persistent object system under development at the University of Wisconsin. SHORE represents a merger of objectoriented database and file system...
David J. Dewitt, Navin Kabra, Jun Luo, Jignesh M. Patel, Jie-bing Yu
This paper describes the design and implementation of Paradise, a database system designed for handling GIS type of applications. The current version of Paradise, uses a client-server architecture...
Michael J. Carey, David J. Dewitt, Je F. Naughton
The OO7 Benchmark represents a comprehensive test of OODBMS performance. In this report we describe the benchmark and present performance results from its implementation in four OODB systems. It is...
David J. Dewitt, Je F. Naughton, Joseph Burger
The research community has considered hash-based parallel join algorithms the algorithms of choice for almost a decade. However, almost none of the commercial parallel database systems use...
Parallel Pointer-Based Join Techniques for Object-Oriented Databases (1993)
Daniel F. Lieuwen, David J. Dewitt, Manish Mehta
In this paper, we describe four parallel pointer-based join algorithms for set-valued attributes. Pointer-based joins will be common in next-generation object-oriented database systems, so...
David J. DeWitt, Jeffrey F. Naughton, Joseph Burger
The research community has considered hash-based parallel join algorithms the algorithms of choice for almost a decade. However, almost none of the commercial parallel database systems use...
Dynamic Memory Allocation for Multiple-Query Workloads (1993)
This paper studies the problem of memory allocation and scheduling in a multiple query workload with widely varying resource requirements. Several memory allocation and scheduling schemes are...
Dynamic Memory Allocation for Multiple-Query Workloads (1993)
ABSTRACT- This paper studies the problem ol memory allocation and scheduling in a multiple query workload with widely varying resource requirements. Several memory allocation and scheduling schemes...
Parallel database systems: the future of high performance database systems (1992)
Abstract: Parallel database machine architectures have evolved from the use of exotic hardware to a software parallel dataflow architecture based on conventional shared-nothing hardware. These new...
Practical Skew Handling in Parallel Joins (1992)
David J. Dewitt, Je F. Naughton, Donovan A. Schneider, S. Seshadri
We present an approach to dealing with skew in parallel joins in database systems. Our approach is easily implementable within current parallel DBMS, and performs well on skewed data without...
Parallel database systems: the future of high performance database systems (1992)
Abstract: Parallel database machine architectures have evolved from the use of exotic hardware to a software parallel dataflow architecture based on conventional shared-nothing hardware. These new...
Crash Recovery in Client-Server EXODUS (1992)
Michael J. Franklin, Michael J. Zwilling, C. K. Tan, Michael J. Carey, David J. Dewitt, Michael J. Franklin, ...
In this paper, we address the correctness and performance issues that arise when implementing logging and crash recovery in a page-server environment. The issues result from two characteristics of...
Practical Skew Handling in Parallel Joins (1992)
David J. Dewitt, Je F. Naughton, Donovan A. Schneider, S. Seshadri
We present an approach to dealing with skew in parallel joins in database systems. Our approach is easily implementable within current parallel DBMS, and performs well on skewed data without...
Parallel Sorting on a Shared-Nothing Architecture using Probabilistic Splitting (1992)
David J. DeWitt, Jeffrey F. Naughton, Donovan A. Schneider
We consider the problem of external sorting in a shared-nothing multiprocessor. A critical step in the algorithms we consider is to determine the range of sort keys to be handled by each processor....
Pointer-based Join Techniques for Object-Oriented Databases (1992)
Daniel Lieuwen, David J. DeWitt, Manish Mehta
In this paper, we describe and analyze four parallel pointer-based joins for set-valued attributes. These joins will be common in next-generation object-oriented database systems, so efficiently...
Practical Skew Handling in Parallel Joins (1992)
David J. DeWitt, Jeffrey F. Naughton, Donovan A. Schneider, S. Seshadri
We present an approach to dealing with skew in parallel joins in database systems. Our approach is easily implementable within current parallel DBMS, and performs well on skewed data without...
A Performance Study of Alternative Object Faulting and Pointer Swizzling Strategies (1992)
Seth J. White, David J. Dewitt
This paper presents a portable, efficient method for accessing memory resident persistent objects in virtual memory in the context of the E programming language. Under the approach, objects are...
Crash Recovery in Client-Server EXODUS (1992)
Michael J. Franklin, Michael J. Franklin, Michael J. Zwilling, Michael J. Zwilling, C. K. Tan, C. K. Tan, ...
In this paper, we address the correctness and performance issues that arise when implementing logging and crash recovery in a page-server environment. The issues result from two characteristics of...
A Performance Analysis of Alternative Multi-Attribute Declustering Strategies (1992)
Shahram Ghandeharizadeh, David J. DeWitt, Waheed Qureshi
During the past decade, parallel database systems have gained increased popularity due to their high performance, scalability and availability characteristics. With the predicted future database...
A Performance Study of Three High Availability Data Replication Strategies (1991)
Several data replication strategies have been proposed to provide high data availability for database system applications. However, the tradeoffs among the different strategies for various workloads...
An Evaluation of Non-Equijoin Algorithms (1991)
David J. Dewitt, Je F. Naughton, Donovan A. Schneider
A non-equijoin of relations R and S is a band join if the join predicate requires values in the join attribute of R to fall within a speci ed band about the values in the join attribute of S. We...
Parallel sorting on a shared-nothing architecture using probabilistic splitting (1991)
David J. Dewitt, Je F. Naughton, Donovan A. Schneider
We consider the problem of external sorting in a shared-nothing multiprocessor. A critical step in the algorithms we consider is to determine the range of sort keys to be handled by each processor....
A Performance Study of Three High Availability Data Replication Strategies (1991)
Abstract. Several data replication strategies have been proposed to provide high data availability for database applications. However, the trade-offs among the different strategies for various...
A Performance Study of Three High Availability Data Replication Strategies (1991)
Several data replication strategies have been proposed to provide high data availability for database system applications. However, the tradeoffs among the different strategies for various workloads...
An Evaluation of Non-Equijoin Algorithms (1991)
David J. DeWitt, Jeffrey F. Naughton, Donovan A. Schneider
A non-equijoin of relations R and S is a band join if the join predicate requires values in the join attribute of R to fall within a specified band about the values in the join attribute of S. We...
Parallel Database Systems: The Future of Database Processing or a Passing Fad? (1991)
Parallel database machine architectures have evolved from the use of exotic hardware to a software parallel dataflow architecture based on conventional shared-nothing hardware. These new designs...
David J. Dewitt, David Maier, Fernando Velez
In the engineering and scientific marketplaces, the workstation-server model of computing is emerging as the standard of the 1990s. Implementing an object-oriented database system in this environment...
Chained Declustering: A New Availability Strategy for Multiprocessor Database Machines (1990)
This paper presents a new strategy for increasing the availability of data in multi-processor, shared-nothing database machines. This technique, termed chained declustering, is demonstrated to...
The Gamma database machine project (1990)
David J. Dewitt, Shahram Ghandeharizadeh, Donovan Schneider, Allan Bricker, Hui-i Hsiao, Rick Rasmussen
This paper describes the design of the Gamma database machine and the techniques employed in its implementation. Gamma is a relational database machine currently operating on an Intel iPSC/2...
Donovan A. Schneider, David J. Dewitt
During the past five years the design, implementation, and evaluation of join algorithms that exploit large main memories and parallel processors has received a great deal of attention. However, most...
Chained Declustering: A New Availability Strategy for Multiprocssor Database machines (1990)
This paper presents a new strategy for increasing the availability of data in multi-processor, shared-nothing database machines. This technique, termed chained declustering, is demonstrated to...
The EXODUS Extensible DBMS Project: An Overview (1990)
Michael J. Carey, David J. Dewitt, Goetz Graefe, David M. Haight, Joel E. Richardson, Daniel T. Schuh, ...
This paper presents an overview of EXODUS, an extensible database system project that is addressing data management problems posed by a variety of challenging new applications. The goal of the...
Donovan A. Schneider, David J. Dewitt
During the past five years the design, implementation, and evaluation of join algorithms that exploit large main memories and parallel processors has received a great deal of attention. However, most...
The Gamma database machine project (1990)
David J. Dewitt, Shahram Ghandeharizadeh, Donovan Schneider, Allan Bricker, Hui-i Hsiao, Rick Rasmussen
This paper describes the design of the Gamma database machine and the techniques employed in its implementation. Gamma is a relational database machine currently operating on an Intel iPSC/2...
Tradeoffs in Processing Complex Join Queries via Hashing in Multiprocessor Database Machines (1990)
Donovan A. Schneider, David J. Dewitt
ABSTRACT- In this paper we examine the problem of processing multi-way join queries (on the order of 10 joins) through hash-based join methods in a shared-nothing database machine. We first discuss...
Donovan A. Schneider, David J. Dewitt
The join operator has been a cornerstone of relational database systems since their inception. As such, much time and effort has gone into making joins efficient. With the obvious trend towards...
Donovan A. Schneider, David J. DeWitt
The join operator has been a cornerstone of relational database systems since their inception. As such, much time and effort has gone into making joins efficient. With the obvious trend towards...
A performance analysis of the Gamma database machine (1988)
David J. Dewitt, Shahram Ghandeharizadeh, Donovan Schneider
This paper presents the results of an initial performance evaluation of the Gamma database machine based on an expanded version of the single-user Wisconsin benchmark. In our experiments we measured...
The EXODUS Optimizer Generator (1987)
Goetz Graefe David, David J. Dewitt
This paper presents the design and an initial performance evaluation of the query optimizer generator designed for the EXODUS extensible database system. Algebraic transformation rules are translated...
Object and file management in the EXODUS extensible database system (1986)
Michae. J. Carey, David J. Dewitt, Joel E. Richardron, Eugene J. Shekita
This paper describes the design of the object-oriented storage component of EXODUS, an extensible database manaaement~svstern currently under development at the University of-Wiscon&t. The basic...
The architecture of the EXODUS extensible DBMS (1986)
Michael J. Carey, David J. Dewitt, Daniel Frank, Goetz Graefe, Joel E. Richardson, Eugene J. Shekita, ...
With non-traditional application areas such as engineering design, image/voice data management, scientific/statistical applications, and artificial intelligence systems all clamoring for ways to...
Gamma - a high performance dataflow database machine (1986)
David J. Dewitt, Robert H. Gerber, Goetz Graefe, Michael L. Heytens, Krishna B. Kumar, M. Muralikrishna
National Science Foundation under grants DCR-8512862, MCS82-01870, and MCS81-05904, and by a Digital
Multiprocessor hash-based join algorithms (1985)
David J. Dewitt, Robert Gerber
This paper extends earlier research on hash-join algorithms to a multiprocessor architecture. Implementations of a number of centralized join algorithms are described and measured. Evaluation of...
Integrated Concurrency Control and Recovery Mechanisms: Design and Performance Evaluation (1985)
Rakesh Agrawal, David J. Dewitt
In spite of the wide variety of concurrency control and recovery mechanisms proposed during the past decade, the behavior and the performance of various concurrency control and recovery mecha-nisms...
An evaluation of buffer management strategies for relational database systems (1985)
Hong-tai Chou, David J. Dewitt, Junfei Geng, Dazhi Wang, Jing Zhang, Junyi Xie
Multiprocessor Hash-Based Join Algorithms (1985)
David J. DeWitt, Robert Gerber
This paper extends earlier research on hash-join algorithms to a multiprocessor architecture. Implementations of a number of centralized join algorithms are described and measured. Evaluation of...
A Taxonomy of Parallel Sorting (1984)
Bitton, Dina, DeWitt, David J., Hsiao, David K., Menon, Jaishankar
In this paper, we propose a taxonomy of parallel sorting that includes a broad range of array and file sorting algorithms. We analyze the evolution of research on parallel sorting, from the earliest...
A Taxonomy of Parallel Sorting (1984)
Bitton, Dina, DeWitt, David J., Hsiao, David K., Menon, Jaishankar
In this paper, we propose a taxonomy of parallel sorting that includes a broad range of array and file sorting algorithms. We analyze the evolution of research on parallel sorting, from the earliest...
A Methodology for Database System Performance Evaluation (1984)
This paper presents a methodology for evaluating the performance of database management systems and database machines in a multiuser environment. Three main factors that affect transaction throughput...
Benchmarking Database Systems A Systematic Approach (1983)
Dina Bitton, Carolyn Turbyfill, David J. DeWitt, David J. Dewitt
This paper describes a customized database and a comprehensive set of queries that can be used for systematic benchmarking of relational database systems. Designing this database and a set of...
Benchmarking database systems: A systematic approach (1983)
Dina Bitton, Carolyn Turbyfill, David J. Dewitt, David J. Dewitt
This paper describes a customized database and a comprehensive set of queries that can be used for sys-tematic benchmarking of relational database systems. Designing this database and a set of...
A comparison of c-store and row-store in a common framework (1566)
Alan Halverson, Jennifer L. Beckmann, Jeffrey F. Naughton, David J. Dewitt
Recently, a “column store ” system called C-Store has shown significant performance benefits by utilizing storage optimizations for a read-mostly query workload. The authors of the C-Store paper...
Using a Knowledge Cache for Interactive Discovery of Association Rules
Biswadeep Nag, Prasad M. Deshpande, David J. Dewitt
Association rule mining is a valuable decision support technique that can be used to analyze customer preferences, buying patterns, and product correlations. Current systems are however handicapped...
Optimizing Loops in Database Programming Languages
Daniel F. Lieuwen, David J. DeWitt
Database programming languages like O 2 , E, and O++ include the ability to iterate through a set. Nested iterators can be used to express joins. We describe compile-time optimizations of such...
OPT++: An Object-Oriented Implementation for Extensible Database Query Optimization
In this paper we describe the design and implementation of OPT++, a tool for Extensible Database Query Optimization that uses an object-oriented design to simplify the task of implementing,...
The focus of the Paradise project [1,2] is to design and implement a scalable database system capable of storing and processing massive data sets such as those pro- duced by NASA's EOSDIS...
OPT++: An Object-Oriented Implementation for Extensible Database Query Optimization
In this paper we describe the design and implementation of OPT++, a tool for Extensible Database Query Optimization that uses an object-oriented design to simplify the task of implementing,...