M.R. Stonebraker, E. Wong, and P. Kreps. The design and implementation of INGRES. TODS, 1(3):189--222, September 1976.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....In the opposite, query planning memorizes many alternatives to find the plan that has the minimum cost. The diversity of the tasks that should be integrated in a query optimizer makes it one of the most complex components to write in a DBMS. In the past, query optimizers mainly relational ones [25, 1] followed a black box approach. The optimizer knowledge was procedural making it difficult to evolve. Recently, extensible optimizers have been proposed [12, 13, 22] The key idea was to generate a query optimizer from rules for transforming plans into alternative plans. Many rule languages have ....

M. Stonebraker, E. Wong, P. Kreps, G. Held. The Design and Implementation of INGRES. ACM Trans. on Database Systems, 1 (3), 1976.

....we discuss the concerned design issues for both modules, review the related work, and describe the approaches we adopted in the implementation. 2. 1 Cache Management Conventional relational database query languages always allow users to save the final query results in relations [S 79, SWK76] Under certain conditions, for example, when sorting is performed or nested queries are present, query intermediate results must also be produced to facilitate the query computations. Though theses intermediate results are mostly retained only within the computation of a query, it is not hard to ....

M. Stonebraker, E. Wong, and P. Kreps. The design and implementation of INGRES. ACM TODS, 1(3):189--222, 1976.

....which are dealing with topological and metric relationships. 2. The requests of spatial queries to query languages The advancing direction of spatial query is to develop powerful spatial query language [2 7] Traditional database qury languages, such as Structyred Query Language (SQL) [8] , Quel [1] and QBE (Query By Example) 10] are not adapted to processing spatial data, because they do not consider spatial attributes. Some structured query languages with particular extentions have been developed in order to process complex objects, and spatial data [5,6] As to ....

Stonebraker,M., Wong,E., Kreps,P., and Held,G., The Design and Implementation of INGRES. ACM Trans. on Database Systems, 1976, Vol.1, No.3, pp.189-222.

....then show performance measurements of the join processing system. 12 CHAPTER 3 RELATED WORK 3. 1 Introduction to Ingres An earlier system that had some influence on the design we have chosen for join trigger processing in TriggerMan is INGRES (Interactive Graphics and Retrieval System) Ingres [Sto76] is a relational database system that is implemented on top of the UNIX operating system. INGRES supports QUEL (Query Language) which is its primary query language and for purposes of providing a customized user interface also supports EQUEL (Embedded QUEL) EQUEL is QUEL embedded in the ....

Stonebraker, M., Wong, E., Kreps, P., & Held, G., The design and implementation of INGRES. TODS 1(3): 189-222(1976). 46

....on a single disk page, whereas large storage objects occupy multiple disk pages. In either case, the object identifier (OID) of a storage object is of the form (page #, slot #) Pages containing small storage objects are slotted pages, as in INGRES, System R, and WiSS [Astrahan, et al. 1976, Stonebraker, et al. 1976, Chou, et al. 1985] as such, the OID of a small storage object is a pointer to the object on disk. For large storage objects, the OID points to a large object header. This header resides on a slotted page with other large object headers and small storage objects, and it contains pointers to ....

Stonebraker, M., G. Wong, P. Kreps, and G. Held, "The Design and Implementation of INGRES", ACM Transactions on Database Systems 1, 3, September 1976.

....of the database schema than it is reasonable to expect the average user to have and are unlikely to be included in a commercially available GIS. The DBMS may have mechanisms for imposing specific integrity constraints. Frequently these are restricted to simple constraintsin the case of Ingres [Stonebraker et al. 1976)] they are simple predicates involving constant values, comparison operators and attributes from a single relation. Such simple facilities cannot even enforce constraints such as the referential integrity condition which is a fundamental part of the relational model itself. 6 Formal techniques ....

....the system will maintain a knowledge base derived from previous transfers. BQL: A Notation for Specifying Data File Formats Use of the BQL notation for describing data formats [Pascoe (1990) combines the use of relational database technology and compiler generating tools. Specifically, Ingres [Stonebraker et al. 1976)] yacc [Johnson (1979) and lex [Lesk and Schmidt (1979) are used to process data files described by BQL specifications. Given a BQL specification of a transfer file format, a program can be generated (fig. 1) for reading (decoding) data from, and writing (encoding) data to, files of that ....

Stonebraker, M., Wong, E., Kreps, P. & Held, G. The Design and Implementation of Ingres, ACM TODS, 1(3), pp189-222, (1976).

....the inner loop of query evaluation; it is performed several times for each participating tuple. This document describes the possible tuples data model. The model adds valid time historical indeterminacy to TQuel [Snodgrass 1987] TQuel is a strict superset of Quel, the query language for Ingres [Stonebraker et al. 1976]. TQuel has a complete, formal semantics which we extend to support historical indeterminacy. We could have extended SQL [Melton 1990] While there are numerous proposed temporal extensions of SQL, none of these extensions have a complete, formal semantics. In addition, the temporal database ....

....representation of three words for nonuniform distributions and two words for uniform distributions and for intensional distributions will be sufficient for most applications. As a comparison, the current DB2 timestamp representation is 2. 5 words ( Date White 1990] the commercial Ingres ([Stonebraker et al. 1976]) representation is three words, and the proposed SQL2 ( Melton 1990] representation is six words, all with a significantly shorter extent and without any historical indeterminacy. 25 6.2 Query Evaluation Algorithms The five functions discussed in Section 5, Adjust , Shrink r , Shrink l , ....

Stonebraker, M., E. Wong, P. Kreps and G. Held. "The Design and Implementation of INGRES." ACM Transactions on Database Systems, 1, No. 3, Sep. 1976, pp. 189--222.

....this reign. Most leading companies in the database industry are coming out with their own object relational database system. A system called POSTGRES [SR86] is credited with being one of the first object relational database management systems. POSTGRES began its development where the INGRES DBMS [Sto76] halted. Developed at the University of California at Berkeley, the INGRES DBMS had been designed to handle the high demands of complex applications. As new features to the relational database management system evolved, a new project, namely POSTGRES, was needed. POSTGRES offers substantial ....

M. Stonebraker. The design and implementation of INGRES. AACMTODS, September 1976.

....database systems do all of their optimization in a single step; the expectation (which does not generally hold for large query plans [AZ96] or for queries over data where few statistics are available) is that the optimizer has sucient knowledge to build an ecient query plan. The INGRES optimizer [SWKH76] and techniques for mid query re optimization [KD98] often yield better running times, because they re optimize later portions of the query plan as more knowledge is gained from executing the earlier stages. Similar re optimization 2 techniques can also be applied to interactive domains, as ....

Michael Stonebraker, Eugene Wong, Peter Kreps, and Gerald Held. The design and implementation of INGRES. TODS, 1(3):189-222, 1976.

....algorithm that satisfies to above mentioned properties. What distinguish our framework from conventional frameworks for query optimization is that conventional ones do not benefit from the dependency between queries. Conventional frameworks optimize a query in isolation of other queries [Ullm 89, SWKH 76] The remainder of this paper is organized as follows. In Section 2, we outline some preliminaries. In Section 3, we present a number of search strategies and study what kind of queries are generated by them, in order to discover knowledge. Then, in Section 4, we discuss how to optimize the ....

Stonebraker, M., Wong, E., Kreps, P., Held, G., The Design and Implementation of Ingres, ACM. Trans. on Database Systems 1(3), pp. 189-222.

....entities and relationships stored in a database could be traced to the syntax trees and vice versa. Originally, we developed a hybrid PKB for storing programs in language based software development environments [9] In the original PKB for language based programming environments, we used INGRES [25], rather than PROLOG, to store the global design model) 1 LADE is a trademark of Xorian Technologies 22 Fig. 5 depicts major components of a PQL based Static Program Analyzer (SPA) Arrows indicate information flows among components. program designs COBOL program SPA front end PKB user ....

Stonebraker, M., Kreps, P. and Held, G. "The Design and Implementation of INGRES," ACM Transactions on Database Systems 1 (3), 1976

....high in the presence of valid time indeterminacy, and it should not be affected at all in its absence. This document describes the possible chronons data model. The model adds valid time indeterminacy to TQuel [Snodgrass 1987] TQuel is a strict superset of Quel, the query language for Ingres [Stonebraker et al. 1976]. TQuel has a complete, formal semantics which we extend to support valid time indeterminacy. We could have extended SQL [Melton 1990] While there are numerous proposed temporal extensions of SQL, none of these extensions have a complete, formal semantics. In addition, the temporal database ....

Stonebraker, M., E. Wong, P. Kreps and G. Held. "The Design and Implementation of Ingres." ACM Transactions on Database Systems, 1, No. 3, Sep. 1976, pp. 189--222.

....queries may share common sub graphs. Thus a single directed acyclic graph with multiple sinks represents a set of queries. Several graphical query languages have been proposed to bridge the gap between non programmer users and traditional text based query languages such as SQL [2] and QUEL [3], all having their own strengths and weaknesses. A classic approach, IBM s QBE (Query By Example) 4] uses table templates to represent a query. It is useful in constructing simple queries, but its requirement of using constraint variables to relate different attributes from different tables can ....

P. Kreps M. Stonebraker, E. Wong and G. Held. The design and implementation of INGRES. ACM TODS, vol.1, no.3, pages 189--222, 1976.

....restricted to memory bound query processing. We will consider the integration of these methods in the future. Although it is generally acknowlegded that multi way join algorithms can impove performance [11] there is relatively little work in the literature. The first such proposal was in INGRES [6]. Rich et.al. addressed implicit replication by use of non normalized join indexes [2] Both of the above approaches applied only to star queries. In [7] we proposed a general multi way join algorithm, for acyclic queries, that performs best when data fits into main memory. The literature on ....

M. Stonebraker et. al. The design and implementation of ingres. ACM TODS, 1(3):189--222, Sept. 1976.

....sequence of binary joins, especially when join attributes are indexed and each join increases result size. We show that a cascade of binary hierarchical joins (HJOIN) combines the advantages of two competitors: a cascade of binary joins using (index ) nested loops, and Ingres tuple substitution [SWK 76, WY76]. It will also require lower implementation effort than adding a multiway (k ary) join to the optimizer s target machine. More generally, any (binary) join plan containing at least one (Index ) Nested Loops Join can be improved by converting this to an HJOIN. Furthermore, we show that HJOIN s ....

Stonebraker, M., Wong, E., Kreps, P., and Held, G.D., "The Design and Implementation of INGRES", ACM Transactions on Database Systems, vol. 1, no. 3, pp. 189--222, September 1976.

....guaranteed. 1 Introduction Many different approaches for optimizing and evaluating declarative queries, e.g. with respect to distributed or heterogeneous database systems, have been proposed so far (comprehensive overviews can be found in [12] and [8] Many query languages like SQL [11] QUEL [20] or POSTQUEL [17] also provide means for a declarative specification of database updates (in the following referred to as update queries, in contrast to read only queries) This enables the user to easily change the content of the database in an intuitive way. So far, particular strategies for the ....

....Jones 32.000 Brown 35.000 Smith 35.200 Brown 35.000 Smith 35.200 Brown 38.500 Smith Figure 1: State of the index before and after the evaluation of the first and second update operation resp. the arrows marks the entry which has to be processed next. Example 2: given in a similar form in [20]) The relation Employees is given as in example 1. Now all employees whose managers earn at least 33.000 should get a salary increase by 10 . If we apply the set oriented strategy, obviously only Smith s and Brown s salary is increased. But if we follow the record oriented strategy and examine ....

[Article contains additional citation context not shown here]

M. Stonebraker, E. Wong, P. Kreps, G. Held: "The Design and Implementation of INGRES ", ACM Transactions on Datebase Systems, 1(3), pp. 189--222, 1976.

....8 retrieve (people.all) where people.c = US and people.name = Chaillou and people.o = University of Wisconsin # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # Table 1. The Test Queries and Their Identifying Numbers. queries expressed in QUEL [20]) ############################################ Table 2 gives the results of our experiments. The number of items returned by each query is listed. The cold cache performance measurements are listed for each program along with the number of servers they contacted in processing the query. The cold ....

M. Stonebraker, P. Kreps, E. Wong, and G. Held, "The Design and Implementation of INGRES," ACM Transactions on Database Systems 1(3), pp. 189-222 (September 1976).

....for querying temporal data. These new operators include when [15] 27] 60] as of [60] joins [27] slice [15] and shift [27] The example below is given in the temporal query language TQuel [60] It is a superset of Quel, the query language of the INGRES database management system [65]. The first example shows a query with respect to valid time (using a when clause) and the second example shows a query with respect to the transaction time (using a as of clause) Example 9: What was Mary s salary in October 1993 retrieve (f.salary) where f.name= Mary when f overlap ....

M. Stonebraker, E. Wong, P. Kreps, and G. Held, "The Design and Implementation of INGRES", in ACM Transactions on Database Systems, 1(3):189222, Sept. 1976.

....schema and external schema permits changing logical databases independent of applications, 8 by redefining the mapping. There have been many successful implementations of the relational data model. Early experimental systems include System R of IBM San Jose [Astrahan76] INGRES of UC Berkeley [Stonebraker76], MRDS of Honeywell [Honeywell80] and PRTV of IBM United Kingdom [Schmidt83, Todd76] 1.3. Recent Research and Related Work As the need for databases started to extend to non business type applications, it became clear that the traditional database technology was neither effective nor flexible. A ....

Stonebraker, M., Wong, E., Kreps, P. and Held, G., Wade, N. W. and and Waston, R., "Design and Implementation of INGRES," ACM Transactions on Database Systems, 1(3), 1976.

....Today: Date ############################################################################################## Figure 4.6: A complete employee database example amenable to query optimization techniques. In this section we present the design of the EXCESS query language. While EXCESS is based on QUEL [Ston76], we have borrowed ideas from the QUEL extensions developed for GEM [Zani83] and POSTGRES [Rowe87, Ston87b] as well as work on SQL extensions for handling NF 2 data [Dada86, Sche86] Salient features of the EXCESS language include: a uniform treatment of all kinds of sets and arrays, including ....

M. Stonebraker, E. Wong, P. Kreps, and G. Held, "The Design and Implementation of INGRES", ACM TODS 1(3), Sept. 1976.

....(approximately) matched trees to the pattern from a database, or extract information from trees pertinent to the pattern. 3 ATBE has many salient features. 1. It can support a wide variety of applications: ATBE provides a query language for tree comparison based on a relational database language [33]. The system is customizable. Users can tailor the system to meet the needs of their applications by inserting application specific trees and application specific distance metrics and operations. 2. It manipulates trees in a uniform manner: There are numerous ways to represent or describe a tree ....

....t) 0 Fig. 9. ATBE query for retrieving subtrees. Solution subtrees obtained from the query are displayed one at a time; they may also be displayed on a tree basis, namely, the entire tree is displayed with corresponding subtrees highlighted [42] Like most other query languages [3] [33], ATBE also allows users to store solution (sub)trees in a file, rather than only display them on the screen. For example, retrieve tree t from F into G where dist(pa, t) max ( dist(pa, v) where v is tree of F) stores trees of file F that are most dissimilar to (worst matching) the pattern in ....

M. Stonebraker, E. Wong, P. Kreps, and G. Held, "The design and implementation of INGRES," ACM Trans. Database Syst., vol. 1, no. 3, pp. 189-222, 1976.

....) G E maps query graphs to executable expressions. In the following paragraphs, we catalog algorithms for each of these suboperations. Q graph has many implementations, one for every data language: Q graph( R ) Sql graph( R ) SQL language [Cha76] Quel graph( R ) QUEL language [Sto76] Gem graph( R ) GEM language [Zan83] The actual choice of Q graph algorithm is component specific (e.g. Sql graph(R) is used for components that present an SQL interface, Quel graph(R) is used for components that present a QUEL interface, and so on) Reducing phase and Joining phase ....

M. Stonebraker, E. Wong, P. Kreps, and G. Held, `The Design and Implementation of INGRES', ACM Transactions on Database Systems, 1 #3 (Sept. 1976).

....sketch) and t the type of the object. As indicated in Figure 1 references are uni directional , i.e. they are maintained in one direction only. As mentioned above, this conforms to (almost) all proposed object models. 2. 4 The Query Language For our object model we developed a QUEL like [21] query language along the lines of the EXCESS object query language that was designed as the declarative query language for the EXTRA object model [4] Currently, our optimizer [12] supports only the declarative QUELlike query language. In the future we intend to support other declarative query ....

M. Stonebraker, E. Wong, P. Kreps, and G. Held. The design and implementation of INGRES. ACM Trans. Database Syst., 1(3):189--222, Sep 1976.

.... More specifically we have measured and compared the performance of the database machine DIRECT [DEWI79, BORA82] the Britton Lee IDM 500 database machine with and without a database accelerator (DAC) IDM500, EPST80, UBEL81] the commercial and university versions of the INGRES database system [STON76, STON80], and the ORACLE database system. Since database machines have already been an active field of research for an entire decade, and a few machines have now been implemented, we feel that the time has come for measuring the actual performance enhancement that can be expected from using special ....

Stonebraker, M.R. , E. Wong, and P. Kreps, "The Design and Implementation of INGRES," ACM TODS 1, 3, (September 1976).

....In the opposite, query planning memorizes many alternatives to find the plan that has the minimum cost. The diversity of the tasks that should be integrated in a query optimizer makes it one of the most complex components to write in a DBMS. In the past, query optimizers mainly relational ones [25, 1] followed a black box approach. The optimizer knowledge was procedural making it difficult to evolve. Recently, extensible optimizers have been proposed [12, 13, 22] The key idea was to generate a query optimizer from rules for transforming plans into alternative 0 The work reported here was ....

M. Stonebraker, E. Wong, P. Kreps, G. Held. The Design and Implementation of INGRES. ACM Trans. on Database Systems, 1 (3), 1976.

....(1976, System R at IBM in San Jose [1] With it a declarative query language, SQL, was introduced which has become a standard for relational query languages. System R then was turned into the product SQL DS and, later, DB2. Another influential relational database management system (INGRES [22]) was developed by M. Stonebraker at Berkeley, which in the meantime became a commercial product as well. Nowadays there exist many relational DBMS products. In fact, the three data models were by no means universally accepted. A huge number of more or less academic data models mushroomed ....

M. Stonebraker, E. Wong, P. Kreps, and G. Held. The design and implementation of INGRES. ACM Trans. Database Syst., 1(3):189--222, Sep 1976.

....and Plug Compatible Generics Historically, interchangeable components have been very important for tuning databases. For example, Ingres allows users to select implementations for base relations and indexes from six choices (hash, heap, isam, compressed hash, compressed heap, and compressed isam) [Sto76]. Each alternative is a generic data type. That is, each file structure presents exactly the same interface (which makes them plug compatible) and is parameterized by the data type (base relation or index) to be stored. Of the generic libraries that are available today (e.g. Boo87, Fon90] few ....

M. Stonebraker, E. Wong, P. Kreps, and G. Held, `The Design and Implementation of INGRES', ACM TODS, 1 #3 (Sept. 1976), 189-222.

....to be partitioned into a number of sets. The aggregate function is then applied to each of these partitions, and a new relation is formed using these individual results. From early on, aggregation was included as a facility in query languages. It is present in the most famous languages like QUEL [82, 92] (INGRES [81, 82] SQL [10] System R [9, 18] and QBE [91] as well as in less wide spread languages like ASTRID [36, 37, 38] STRAND [46, 47] etc. However, as it is also pointed out in [47] it can be quite cumbersome to express an aggregate query in these languages. This is partly due to ....

....into a number of sets. The aggregate function is then applied to each of these partitions, and a new relation is formed using these individual results. From early on, aggregation was included as a facility in query languages. It is present in the most famous languages like QUEL [82, 92] INGRES [81, 82]) SQL [10] System R [9, 18] and QBE [91] as well as in less wide spread languages like ASTRID [36, 37, 38] STRAND [46, 47] etc. However, as it is also pointed out in [47] it can be quite cumbersome to express an aggregate query in these languages. This is partly due to heavy syntax ....

Michael Stonebraker, Eugene Wong, Peter Kreps, and Gerald Held. The Design and Implementation in INGRES. ACM TODS, 1(3):189222, 1976.

....which are common to all of them. Then we will derive several necessary consequences arising from the implementation of set operators in any such language belonging to the entity model and thereby contrast such languages with the many languages adhering to the relational database model, e.g. [CGY81,RoS87, Sho79, SWK76]) We hasten to point out that our entity database model is quite distinct from the entity relationship model introduced by Peter Chen [Che76] and extended by several others (e.g. CaS84, TYF86] Their s can be viewed as a design model which is extremely useful for organizing the structure of ....

M. Stonebraker, E. Wong, P. Kreps and G. Held, The Design and Implementation of INGRES, Trans. Database Systems 1,3 (Sep. 1976), 189-222.

....In the opposite, query planning memorizes many alternatives to find the plan that has the minimum cost. The diversity of the tasks that should be integrated in a query optimizer makes it one of the most complex components to write in a DBMS. In the past, query optimizers mainly relational ones [25, 1] followed a black box approach. The optimizer knowledge was procedural making it difficult to evolve. Recently, extensible optimizers have been proposed [12, 13, 22] The key idea was to generate a query optimizer from rules for transforming plans into alternative plans. Many rule languages have ....

M. Stonebraker, E. Wong, P. Kreps, G. Held. The Design and Implementation of INGRES. ACM Trans. on Database Systems, 1 (3), 1976.

....technology of the 1990s. Harnessing the power of this technology will not be easy, as such systems pose many difficult engineering challenges. If one reflects on the commercialization of relational database systems, it took a full ten years to turn the first prototypes (INGRES and System R in 1976 [Ston76, Astr76]) into products that conservative customers willingly used. Given the relative complexity of object oriented database systems, it is likely to take ten years before the technology of object oriented database systems becomes solidified. The situation is further complicated by the emergence of the ....

M. Stonebraker, et al. The design and implementation of INGRES, ACM TODS 1:3, September 1986.

....each relevant tile of the input is read from the disk and processed by the clip operation. II) Compression as an Optimization Strategy While compression techniques have been widely used in many image processing domains, only occasionally have they been integrated directly into a database system [SWKH94, GS91] Several problems arise when such an integration is attempted. First, the unit of compression is generally the entire image. This approach makes sense if the entire image is always required. However, if only a piece of the image is needed, the cost of uncompressing the entire image may ....

M. Stonebraker, E. Wong, P. Kreps, and G. Held. "The Design and Implementation of INGRES", pages 37--53. Morgan Kaufmann, 1994.

....1. Utilize local resources. This is common to all distributed systems. 2. Provide a platform for cooperation. This will be clarified later. 3.2. Overview While distributed relational databases have reached maturity (e.g. R [40] and INGRES [39] the distributed extensions of R [4] and INGRES [38] respectively) the research on distributed OODBs is still in its infancy. Examples of existing prototypes include distributed versions of ORION [25] and AVANCE [1] As mentioned in section 1, the main problem with distributing an OODB is with the high inter connection among many small objects. ....

M. Stonebraker, E. Wong, P. Kreps, and G. Held. The Design and Implementation of INGRES. In ACM Transactions on Database Systems. 1976.

....page contains a pointer to the next and the previous logical page; hence POSTGRES can scan a relation by following the forward linked list. The reverse pointers are required because POSTGRES can execute query plans either forward or backward. Additionally, on each page there is a line table as in [STON76] containing pointers to the starting byte of each anchor point record on that page. Once an anchor point is located, the delta records linked to it can be constructed by following PTR and decompressing the data fields. Although decompression is a CPU intensive task, we feel that CPU resources will ....

Stonebraker, M., et. al. "The Design and Implementation of INGRES," ACM-TODS, September 1976.

....reports, etc. We begin in Section 2 by presenting the data definition facilities for procedural data along with several examples of the use of this construct. Then, in Section 3 we review briefly how to extend one query language with necessary facilities to use procedures. Our choice is QUEL [STON76], but the extensions are easy to map into most other relational query languages. The definition of this language, QUEL , is indicated in Section 3 and is based on suggestions in ############################# This research was sponsored by the U.S. Air Force Office of Scientific Research Grant ....

....Electronics Systems Command Contract N39 82 C 0235 [STON84] Substantial changes to the query execution code of a data base system are required to process QUEL . In Section 4 we indicate the changes that were necessary to support our constructs in the University of California version of INGRES [STON76]. Then, in Section 5 the performance of our prototype on several problems with complex data relationships is indicated. Lastly, Section 6 discusses ways in which the performance of the prototype could be improved. 2. DATA BASE PROCEDURES The motivation behind using procedures as full fledged ....

[Article contains additional citation context not shown here]

Stonebraker, M. et al., "The Design and Implementation of INGRES," ACM-TODS, September 1976.

No context found.

M.R. Stonebraker, E. Wong, and P. Kreps. The design and implementation of INGRES. TODS, 1(3):189--222, September 1976.

No context found.

M. Stonebraker, E. Wong, P. Kreps, and G.D. Held, "The Design and Implementation of INGRES," ACM Transactions on Database Systems, Vol. 1(3), pp. 189-222, (Sept. 1976).

No context found.

M. Stonebraker, E. Wong, P. Kreps, and G. Held. The Design and Implementation of INGRES. ACM Trans. on Database Systems, 1(3):189--222, 1976.

No context found.

Michael Stonebraker, Eugene Wong, Peter Kreps, and Gerald Held. The design and implementation of INGRES. TODS, 1(3):189--222, 1976.

No context found.

M. Stonebraker, E. Wong, P. Kreps, and G. Held. "The Design and Implementation of INGRES." In ACM TODS,1(3), 1976.

No context found.

Stonebraker, Michael, Eugene Wong, and Peter Kreps, "The Design and Implementation of INGRES", ACM Transactions on Database Systems, Vol. 1, No. 3, September, 1976.

No context found.

SW76 Stonebraker, M., Wong, E., Kreps, P. and Held, G., The Design and Implementation of INGRES. ACM TODS, 1,3 (1976), 189-222.

No context found.

M. Stonebraker and et. al. The Design and Implementation of INGRES. In ACM Transactions on Database Systems, September 1976.

No context found.

M. Stonebraker et al. "The Design and Implementation of INGRES", TODS 2, sept. 1976.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC