Search For:

Displaying 1-44 out of 44 total
Meta Data Management
Found in: Data Engineering, International Conference on
By Philip A. Bernstein, Sergey Melnik
Issue Date:April 2004
pp. 875
No summary available.
   
The Claremont report on database research
Found in: Communications of the ACM
By Alexander S. Szalay, Alon Y. Halevy, Anastasia Ailamaki, Anhai Doan, Beng Chin Ooi, Daniela Florescu, Donald Kossmann, Eric A. Brewer, Gerhard Weikum, Hank F. Korth, Hector Garcia-Molina, Johannes Gehrke, Joseph M. Hellerstein, Laura M. Haas, Le Gruenwald, Michael J. Carey, Michael J. Franklin, Michael Stonebraker, Philip A. Bernstein, Raghu Ramakrishnan, Rakesh Agrawal, Roger Magoulas, Samuel Madden, Sunita Sarawagi, Surajit Chaudhuri, Tim O'Reilly, Yannis E. Ioannidis, Alexander S. Szalay, Alon Y. Halevy, Anastasia Ailamaki, Anhai Doan, Beng Chin Ooi, Daniela Florescu, Donald Kossmann, Eric A. Brewer, Gerhard Weikum, Hank F. Korth, Hector Garcia-Molina, Johannes Gehrke, Joseph M. Hellerstein, Laura M. Haas, Le Gruenwald, Michael J. Carey, Michael J. Franklin, Michael Stonebraker, Philip A. Bernstein, Raghu Ramakrishnan, Rakesh Agrawal, Roger Magoulas, Samuel Madden, Sunita Sarawagi, Surajit Chaudhuri, Tim O'Reilly, Yannis E. Ioannidis
Issue Date:June 2009
pp. 101-104
Database research is expanding, with major efforts in system architecture, new languages, cloud services, mobile and virtual worlds, and interplay between structure and text.
     
Compiling mappings to bridge applications and databases
Found in: ACM Transactions on Database Systems (TODS)
By Atul Adya, Philip A. Bernstein, Philip A. Bernstein, Sergey Melnik, Sergey Melnik
Issue Date:November 2008
pp. 1-50
Translating data and data access operations between applications and databases is a longstanding data management problem. We present a novel approach to this problem, in which the relationship between the application data and the persistent storage is spec...
     
Information integration in the enterprise
Found in: Communications of the ACM
By Laura M. Haas, Philip A. Bernstein, Laura M. Haas, Philip A. Bernstein
Issue Date:September 2008
pp. 101-104
A guide to the tools and core technologies for merging information from disparate sources.
     
Mapping XML to a Wide Sparse Table
Found in: IEEE Transactions on Knowledge and Data Engineering
By Liang Jeff Chen,Philip A. Bernstein,Peter Carlin,Dimitrije Filipovic,Michael Rys,Nikita Shamgunov,James F. Terwilliger,Milos Todic,Sasa Tomasevic,Dragan Tomic
Issue Date:June 2014
pp. 1-1
XML is commonly supported by SQL database systems. However, existing mappings of XML to tables can only deliver satisfactory query performance for limited use cases. In this paper, we propose a novel mapping of XML data into one wide table whose columns ar...
 
Mapping XML to a Wide Sparse Table
Found in: Data Engineering, International Conference on
By Liang Jeff Chen,Philip A. Bernstein,Peter Carlin,Dimitrije Filipovic,Michael Rys,Nikita Shamgunov,James F. Terwilliger,Milos Todic,Sasa Tomasevic,Dragan Tomic
Issue Date:April 2012
pp. 630-641
XML is commonly supported by SQL database systems. However, existing mappings of XML to tables can only deliver satisfactory query performance for limited use cases. In this paper, we propose a novel mapping of XML data into one wide table whose columns ar...
 
Adapting microsoft SQL server for cloud computing
Found in: Data Engineering, International Conference on
By Philip A. Bernstein,Istvan Cseri,Nishant Dani,Nigel Ellis,Ajay Kalhan,Gopal Kakivaya,David B. Lomet,Ramesh Manne,Lev Novik,Tomas Talius
Issue Date:April 2011
pp. 1255-1263
Cloud SQL Server is a relational database system designed to scale-out to cloud computing workloads. It uses Microsoft SQL Server as its core. To scale out, it uses a partitioned database on a shared-nothing system architecture. Transactions are constraine...
 
Reverse engineering models from databases to bootstrap application development
Found in: Data Engineering, International Conference on
By Ankit Malpani, Philip A. Bernstein, Sergey Melnik, James F. Terwilliger
Issue Date:March 2010
pp. 1177-1180
Object-relational mapping systems have become often-used tools to provide application access to relational databases. In a database-first development scenario, the onus is on the developer to construct a meaningful object layer for the application because ...
 
Model Management Engine for Data Integration with Reverse-Engineering Support
Found in: Data Engineering, International Conference on
By Michael N. Gubanov, Philip A. Bernstein, Alexander Moshchuk
Issue Date:April 2008
pp. 1319-1321
Model management is a high-level programming language designed to efficiently manipulate schemas and mappings. It is comprised of robust operators that combined in short programs can solve complex metadata-oriented problems in a compact way. For instance, ...
 
Corpus-Based Schema Matching
Found in: Data Engineering, International Conference on
By Jayant Madhavan, Philip A. Bernstein, AnHai Doan, Alon Halevy
Issue Date:April 2005
pp. 57-68
Schema Matching is the problem of identifying corresponding elements in different schemas. Discovering these correspondences or matches is inherently difficult to automate. Past solutions have proposed a principled combination of multiple algorithms. Howev...
 
ModelGen: Model Independent Schema Translation
Found in: Data Engineering, International Conference on
By Paolo Atzeni, Paolo Cappellari, Philip A. Bernstein
Issue Date:April 2005
pp. 1111-1112
A customizable and extensible tool is proposed to implement ModelGen, the model management operator that translates a schema from one model to another. A wide family of models is handled, by using a metamodel in which models can be succinctly and precisely...
   
Adapting a Generic Match Algorithm to Align Ontologies of Human Anatomy
Found in: Data Engineering, International Conference on
By Peter Mork, Philip A. Bernstein
Issue Date:April 2004
pp. 787
The difficulty inherent in schema matching has led to the development of several generic match algorithms. This paper describes how we adapted general approaches to the specific task of aligning two ontologies of human anatomy, the Foundational Model of An...
 
Sequoia: A Fault-Tolerant Tightly Coupled Multiprocessor for Transaction Processing
Found in: Computer
By Philip A. Bernstein
Issue Date:February 1988
pp. 37-45
<p>The Sequoia computer is a tightly coupled multiprocessor that avoids most of the fault-tolerance disadvantages of tight coupling by using a fault-tolerant hardware-design approach. An overview is give of how the hardware architecture and operating...
 
Approaches to concurrency control in distributed data base systems
Found in: Managing Requirements Knowledge, International Workshop on
By Philip A. Bernstein, Nathan Goodman
Issue Date:June 1979
pp. 813
No summary available.
   
Schema merging and mapping creation for relational sources
Found in: Proceedings of the 11th international conference on Extending database technology: Advances in database technology (EDBT '08)
By Philip A. Bernstein, Rachel Pottinger
Issue Date:March 2008
pp. 1-3
We address the problem of generating a mediated schema from a set of relational data source schemas and conjunctive queries that specify where those schemas overlap. Unlike past approaches that generate only the mediated schema, our algorithm also generate...
     
Compiling mappings to bridge applications and databases
Found in: Proceedings of the 2007 ACM SIGMOD international conference on Management of data (SIGMOD '07)
By Atul Adya, Philip A. Bernstein, Sergey Melnik
Issue Date:June 2007
pp. 461-472
Translating data and data access operations between applications and databases is a longstanding data management problem. We present a novel approach to this problem, in which the relationship between the application data and the persistent storage is spec...
     
Model management 2.0: manipulating richer mappings
Found in: Proceedings of the 2007 ACM SIGMOD international conference on Management of data (SIGMOD '07)
By Philip A. Bernstein, Sergey Melnik
Issue Date:June 2007
pp. 1-12
Model management is a generic approach to solving problems of data programmability where precisely engineered mappings are required. Applications include data warehousing, e-commerce, object-to-relational wrappers, enterprise information integration, datab...
     
Relaxed-currency serializability for middle-tier caching and replication
Found in: Proceedings of the 2006 ACM SIGMOD international conference on Management of data (SIGMOD '06)
By Alan Fekete, Hongfei Guo, Philip A. Bernstein, Pradeep Tamma, Raghu Ramakrishnan
Issue Date:June 2006
pp. 599-610
Many applications, such as e-commerce, routinely use copies of data that are not in sync with the database due to heuristic caching strategies used to enhance performance. We study concurrency control for a transactional model that allows update transactio...
     
The many roles of meta data in data integration
Found in: Proceedings of the 2005 ACM SIGMOD international conference on Management of data (SIGMOD '05)
By Philip A. Bernstein
Issue Date:June 2005
pp. 792-792
This paper is a short introduction to an industrial session on the use of meta data to address data integration problems in large enterprises. The main topics are data discovery, version and configuration management, and mapping development.
     
Supporting executable mappings in model management
Found in: Proceedings of the 2005 ACM SIGMOD international conference on Management of data (SIGMOD '05)
By Alon Halevy, Erhard Rahm, Philip A. Bernstein, Sergey Melnik
Issue Date:June 2005
pp. 167-178
Model management is an approach to simplify the programming of metadata-intensive applications. It offers developers powerful operators, such as Compose, Diff, and Merge, that are applied to models, such as database schemas or interface specifications, and...
     
Composition of mappings given by embedded dependencies
Found in: Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (PODS '05)
By Alan Nash, Philip A. Bernstein, Sergey Melnik
Issue Date:June 2005
pp. 172-183
Composition of mappings between schemas is essential to support schema evolution, data exchange, data integration, and other data management tasks. In many applications, mappings are given by embedded dependencies. In this paper, we study the issues involv...
     
Rethinking the conference reviewing process
Found in: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (SIGMOD '04)
By Alon Halevy, Anastassia Ailamaki, David DeWitt, Gerhard Weikum, Jennifer Widom, Michael J. Franklin, Philip A. Bernstein, Zachary Ives
Issue Date:June 2004
pp. 957-957
We demonstrate an XML full-text search engine that implements the TeXQuery language. TeXQuery is a powerful full-text search extension to XQuery that provides a rich set of fully composable full-text primitives, such as phrase matching, proximity distance,...
     
New Applications and future directions (Panel session)
Found in: Proceedings of the ACM international workshop on Data engineering for wireless and mobile access (MobiDE '99)
By Philip A. Bernstein
Issue Date:August 1999
pp. 117
A central challenge in ad hoc networks is the design of routing protocols that can adapt their behavior to frequent and rapid changes in the network. The performance of proactive and reactive routing protocols varies with network characteristics, and one p...
     
Versions and workspaces in Microsoft repository
Found in: Proceedings of the 1999 ACM SIGMOD international conference on Management of data (SIGMOD '99)
By David Shutt, Philip A. Bernstein, Shankar Pal, Thomas Bergstraesser
Issue Date:May 1999
pp. 358-367
This paper describes the version and workspace features of Microsoft Repository, a layer that implements fine-grained objects and relationships on top of Microsoft SQL Server. It supports branching and merging of versions, delta storage, checkout-checkin, ...
     
A model for concurrency in nested transactions systems
Found in: Journal of the ACM (JACM)
By Catriel Beeri, Nathan Goodman, Philip A. Bernstein
Issue Date:January 1988
pp. 230-269
Today's standard model for database concurrency control, called serializability theory, represents executions of transactions as partial orders of operations. The theory tells when an execution is serializable, that is, when the set of operations of a tran...
     
Middleware: a model for distributed system services
Found in: Communications of the ACM
By Philip A. Bernstein
Issue Date:January 1988
pp. 86-98
The online Risks Forum has long been a hotbed for discussions of the relative merits of openness relating to the dissemination of knowledge about security vulnerabilities. The debate has now been rekindled, and is summarized here.
     
An algorithm for concurrency control and recovery in replicated distributed databases
Found in: ACM Transactions on Database Systems (TODS)
By Nathan Goodman, Philip A. Bernstein
Issue Date:December 1984
pp. 596-615
In a one-copy distributed database, each data item is stored at exactly one site. In a replicated database, some data items may be stored at multiple sites. The main motivation is improved reliability: by storing important data at multiple sites, the DBS c...
     
Multiversion concurrency control---theory and algorithms
Found in: ACM Transactions on Database Systems (TODS)
By Nathan Goodman, Philip A. Bernstein
Issue Date:December 1983
pp. 465-483
Concurrency control is the activity of synchronizing operations issued by concurrently executing programs on a shared database. The goal is to produce an execution that has the same effect as a serial (noninterleaved) one. In a multiversion database system...
     
The failure and recovery problem for replicated databases
Found in: Proceedings of the second annual ACM symposium on Principles of distributed computing (PODC '83)
By Nathan Goodman, Philip A. Bernstein
Issue Date:August 1983
pp. 114-122
A replicated database is a distributed database in which some data items are stored redundantly at multiple sites. The main goal is to improve system reliability. By storing critical data at multiple sites, the system can operate even though some sites hav...
     
Database theory: where has it been? where is it going?
Found in: Proceedings of the 1983 ACM SIGMOD international conference on Management of data (SIGMOD '83)
By Philip A. Bernstein
Issue Date:May 1983
pp. 2-2
There is a clear shift of emphasis in the way in which computer systems in general, and database management systems in particular, are perceived in the marketplace today. Questions of usability are beginning to outweigh the more traditional concerns with r...
     
On the correct translation of update operations on relational views
Found in: ACM Transactions on Database Systems (TODS)
By Philip A. Bernstein, Umeshwar Dayal
Issue Date:September 1982
pp. 381-416
Most relational database systems provide a facility for supporting user views. Permitting this level of abstraction has the danger, however, that update requests issued by a user within the context of his view may not translate correctly into equivalent up...
     
Concurrency control algorithms for multiversion database systems
Found in: Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing (PODC '82)
By Nathan Goodman, Philip A. Bernstein
Issue Date:August 1982
pp. 209-215
Concurrency control is the activity of synchronizing operations issued by concurrently executing programs on a shared database. The goal is to produce an execution that has the same effect as a serial (noninterleaved) one. In a multiversion database system...
     
Fast methods for testing quantified relational calculus assertions
Found in: Proceedings of the 1982 ACM SIGMOD international conference on Management of data (SIGMOD '82)
By Barbara T. Blaustein, Philip A. Bernstein
Issue Date:June 1982
pp. 39-50
Semantic integrity assertions are predicates that define consistent states. A database system enforces assertions by ensuring that consistency is maintained as the database is updated.Most research on the efficient enforcement of assertions has concentrate...
     
Query processing in a system for distributed databases (SDD-1)
Found in: ACM Transactions on Database Systems (TODS)
By Christopher L. Reeve, Eugene Wong, James B. Rothnie, Nathan Goodman, Philip A. Bernstein
Issue Date:December 1981
pp. 602-625
This paper describes the techniques used to optimize relational queries in the SDD-1 distributed database system. Queries are submitted to SDD-1 in a high-level procedural language called Datalanguage. Optimization begins by translating each Datalanguage q...
     
Using Semi-Joins to Solve Relational Queries
Found in: Journal of the ACM (JACM)
By Dah-Ming W. Chiu, Philip A. Bernstein
Issue Date:January 1981
pp. 25-40
It is shown that, given an arbitrary GO position on an n × n board, the problem of determining the winner is Pspace hard. New techniques are exploited to overcome the difficulties arising from the planar nature of board games. In particular, it is pro...
     
A language facility for designing database-intensive applications
Found in: ACM Transactions on Database Systems (TODS)
By Harry K. T. Wong, John Mylopoulos, Philip A. Bernstein
Issue Date:June 1980
pp. 185-207
TAXIS, a language for the design of interactive information systems (e.g., credit card verification, student-course registration, and airline reservations) is described. TAXIS offers (relational) database management facilities, a means of specifying semant...
     
The correctness of concurrency control mechanisms in a system for distributed databases (SDD-1)
Found in: ACM Transactions on Database Systems (TODS)
By David W. Shipman, Philip A. Bernstein
Issue Date:March 1980
pp. 52-68
This paper presents a formal analysis of the concurrency control strategy of SDD-1. SDD-1, a System for Distributed Databases, is a prototype distributed database system being developed by Computer Corporation of America. In SDD-1, portions of data distrib...
     
Concurrency control in a system for distributed databases (SDD-1)
Found in: ACM Transactions on Database Systems (TODS)
By David W. Shipman, James B. Rothnie, Philip A. Bernstein
Issue Date:March 1980
pp. 18-51
This paper presents the concurrency control strategy of SDD-1. SDD-1, a System for Distributed Databases, is a prototype distributed database system being developed by Computer Corporation of America. In SDD-1, portions of data distributed throughout a net...
     
Comments on “Process synchronizaiton in databases systems”
Found in: ACM Transactions on Database Systems (TODS)
By Marco A. Casanova, Nathan Goodman, Philip A. Bernstein
Issue Date:December 1979
pp. 545-546
A transposed file is a collection of nonsequential files called subfiles. Each subfile contains selected attribute data for all records. It is shown that transposed file performance can be enhanced by using a proper strategy to process queries. Analytic co...
     
Synthesizing independent database schemas
Found in: Proceedings of the 1979 ACM SIGMOD international conference on Management of data (SIGMOD '79)
By Joachim Biskup, Philip A. Bernstein, Umeshwar Dayal
Issue Date:May 1979
pp. 143-151
We study the following database design problem. Given a universal relation scheme 〈U, F〉 where F is a set of functional dependencies, find an in some way normalized database schema D = {〈X1, F1〉,..., 〈Xn, Fn〉} wher...
     
Computational problems related to the design of normal form relational schemas
Found in: ACM Transactions on Database Systems (TODS)
By Catriel Beeri, Philip A. Bernstein
Issue Date:March 1979
pp. 30-59
Problems related to functional dependencies and the algorithmic design of relational schemas are examined. Specifically, the following results are presented: (1) a tree model of derivations of functional dependencies from other functional dependencies; (2)...
     
The logic of a relational data manipulation language
Found in: Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (POPL '79)
By Marco A. Casanova, Philip A. Bernstein
Issue Date:January 1979
pp. 101-109
A logic for a relational data manipulation language is defined by augmenting a known logic of programs with rules for two new statements: the relational assignment, which assign a relational expression to a relation, and the random tuple selection, which e...
     
A language facility for designing interactive database-intensive applications
Found in: Proceedings of the 1978 ACM SIGMOD international conference on management of data (SIGMOD '78)
By Harry K. T. Wong, John Mylopoulos, Philip A. Bernstein
Issue Date:May 1978
pp. 17-17
This paper describes TAXIS, a language for the design of Interactive Information Systems (e.g., credit card varification, student-course registration and airline reservations). TAXIS offers (relational) database management facilities, a means of specifying...
     
Synthesizing third normal form relations from functional dependencies
Found in: ACM Transactions on Database Systems (TODS)
By Philip A. Bernstein
Issue Date:December 1976
pp. 277-298
It has been proposed that the description of a relational database can be formulated as a set of functional relationships among database attributes. These functional relationships can then be used to synthesize algorithmically a relational scheme. It is th...
     
 1