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).

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.

First 50 documents

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