Stonebraker, M., Anderson, E., Hanson, E. N and Rubenstein, W. B. "Quel as a Data type", SIGMOD Conference 1984 : 208-214.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of the input LISP expression, the SQL EVALUATE operator does immediate evaluation of the input SQL conditional expression for a given input data item. Our approach of managing expressions as data in RDBMS is somewhat similar to the notion of supporting QUEL commands as a data type in INGRES [SAHR84]. However, QUEL as a data type is primarily motivated to provide a way of representing a set of records through QUEL commands. In contrast, our intent of storing expressions is to capture interest in terms of filtering criteria, which evaluate to TRUE or FALSE for an input data item. Existing ....

Stonebraker, M., Anderson, E., Hanson, E. N and Rubenstein, W. B. "Quel as a Data type", SIGMOD Conference 1984 : 208-214.

....p, I p) The definition of P (Np, Ep, p, p, I p) is similar to the definition of G (N, E, v, e, Figure II. 1) Two components of a constraint can be defined on this graph: temporal functions and spatial functions. Temporal functions: Temporal functions are defined as calculated attributes [13] with the qualification: Time. Let us define T as a generic domain for time data. Let us define 7 as the closed difference operator between two elements defined on T. Let us denote J 7 the undefined value on T (whenever Time attributes are not available in the database schema) The application ....

Stonebraker M, Aderson E, Hanson E, Rubenstein B: QUEL as a Data Type, Proc. ACM SIGMOD Conference, Boston, USA, June 1984

....In [MMM97] WebSQL is used to query the Web in navigational style. GW00] combines the query facilities of traditional databases with existing search engines on the Internet. LSK95] queries a central mapping information of all participating, distributed data sources. Stonebraker et.al. SAHR84] propose a related approach to our HyperQueries. But their work is restricted to stored queries in centralized databases. SOAP [BEK 00] provides a mechanism for exchanging information between distributed applications using XML. YP00] describes a reference architecture for interoperable ....

....Sub Contractor 2 Client Market Place (a) Hierarchical Query Processing (b) Broadcast Query Processing Figure 2: Flow of Control and Flow of Objects (Dashed lines indicate the flow of control and intermediate results, solid lines indicate the flow of result objects) on demand. In contrast to [SAHR84] we do not store the queries, i.e. the sub plans to be executed at data providers, within virtual attributes. Instead, hyperlinks referencing the sub plans are embedded as virtual attributes within the data. The queries themselves are located at the distributed data providers (remote hosts) We ....

M. Stonebraker, E. Anderson, E. Hanson, and B. Rubenstein. QUEL as a Data Type. In Proc. of the ACM SIGMOD Conf. on Management of Data, pages 208--214, June 1984.

.... in POSTGRES: ffl integers; ffl floating point numbers; ffl fixed length character strings; ffl unbounded varying length arrays of fixed types with an arbitrary number of dimensions; ffl POSTQUEL, which contains a sequence of data manipulation commands used to simulate shared complex objects [SAHR84] and ffl procedure, which contains procedures written in a general purpose programming language with embedded data manipulation commands also used to represent complex objects [SAH87] CHAPTER 1. INTRODUCTION 7 In addition to these built in data types, user defined data types can be defined ....

M. R. Stonebraker, E. Anderson, E. Hanson, and B. Rubenstein. Quel as a data types. In Proceedings of the ACM-SIGMOD International conference on Management of Data, Boston, Mass., June 1984.

....of computable queries not expressible in the relational algebra are parity checking and transitive closure computation. Our motivation for this study stems from the increasing attention that 2 is being paid to procedural data management in database systems. To our knowledge, Stonebraker et al. [27, 28] were the first to investigate the treatment of programs as data in the field of databases. Taking an informal point of view, they argued that a wide range of applications can benefit from procedural data. Then there is the current interest in so called active databases [21, 22] dealing with ....

....of each view only at run time. 3.3 Procedural data Analogous to the way Ross s model and algebra generalize the notion of a dictionary, procedural data generalizes the idea of storing view definitions in relations. Storing programs as data has been investigated earlier by Stonebraker et al. [27, 28]. In a practical context, they proposed a system, called QUEL , allowing QUEL programs to be stored as strings in tuple components and executed dynamically. QUEL can easily be formalized in the reflective algebra, as will be described next. Recall the Persons Hobbies database from Subsection ....

M. Stonebraker et al. QUEL as a data type. In B. Yormark, editor, Proceedings of SIGMOD 84 Annual Meeting, volume 14:2 of SIGMOD Record, pages 208--214. ACM Press, 1984.

....role in database design. This is not an issue for the user; rather, it is a back end issue for the design tool to consider. Currently there are a number of different languages to choose from when creating a database. The three most 1 2 influential commercial languages are SQL, QBE, and Quel [Sto84] SQL was selected as the language to be used in this project. 1.1.1 History The goal of a data model involves achieving a high degree of simplicity in order to provide ease of use. In addition, the data model also needs to incorporate a significant level of power to sufficiently represent the ....

M. Stonebraker. Quel as a Data Type, Proceedings of the ACM SIGMOD Conference on Management of Data, Boston, MA, June 1984.

....or ORACLE style clustering [78] these on top implementations are not likely to show good performance. One example of such an implementation on top of a research relational DBMS is described in [52] Before we turn to query languages, let us comment on the idea of Using QUEL as a data type [121]. This idea finally led to the POSTGRES approach of implementing complex objects by attributes, whose values are query language expressions that dynamically retrieve the subobjects . If we stick with relations and relational QUEL as the query language with this nesting capability, then we obtain ....

M.R. Stonebraker, E. Anderson, E. Hanson, and B. Rubinstein. QUEL as a data type. In Proc. ACM SIGMOD Conf. on Management of Data, pages 208--214, Boston, MA, June 1984. ACM, New York.

....systems, such as active and object oriented systems, as well as the data dictionaries of standard relational database systems, provide the functionality of stored procedures . The potential functionality of such systems was already envisaged by Stonebraker and his collaborators in the 80s [21, 22]. However, little work has been done on formal models providing logical foundations for such systems. Indeed, current systems approaches treat stored procedures simply as string values. Only the special case of schema querying has received a significant amount of attention (e.g. 8, 14] The ....

M. Stonebraker et al. QUEL as a data type. In B. Yormark, editor, Proceedings of SIGMOD 84 Annual Meeting, volume 14:2 of SIGMOD Record, pages 208--214. ACM Press, 1984.

....automatically derived by the definition of the associated predicate and its definition need not be changed. That is, the setvalued attribute friends is a derived attribute and depends on the actual state of the extension of class Employee. Such attributes can be compared to the approach taken in [SAHR], where query statements can be used as attribute values. In general, TM s predicative sets can be defined using a full first order logic with typed variables and special boolean expressions. The general format of a predicative set is fx : oe j OE(x)g; where OE(x) is a boolean expression, and oe ....

M. Stonebraker, E. Anderson, E. Hanson & B. Rubenstein, "QUEL as a data type," in Proceedings of ACM-SIGMOD 1984 International Conference on Management of Data, Boston, MA, June 18--21, 1984, B. Yormark, ed., ACM, New York, NY, 208--214, (also appeared as SIGMOD RECORD 14, 2, June, 1984).

....be addressed. A second approach is to start from a database system and build into it a rich type system and other useful programming notions such as recursion and higher order functions, to make the database system have enough power to cope with complexities inherent in engineering environments [Shoens79, Stonebraker84, 86a, 87]. A third approach is to define new database programming languages from scratch. These database programming languages typically are rich in data structuring capability, versatile in data persistence and complete in computing power [Albano85, Cardelli84, Ohori89] 12 Object oriented programming ....

....the logic programming framework with a type hierarchy. But his type system does not distinguish instances from schemas. Nevertheless, the Y term in his system has great influence on the design for the object definition language of TEDM. The work of putting QUEL commands into the INGRES database [Stonebraker84] bears certain similarities with TEDM s view of database commands as objects. But the similarities hold only at a superficial level. The two approaches are fundamentally different in the way how 15 the stored commands are treated and what we can do to them. In INGRES, a QUEL command is stored as ....

[Article contains additional citation context not shown here]

Stonebraker, M., Anderson, E., Hanson, E. and Rubenstein, B., "QUEL as a Data Type," Proceedings of the ACM-SIGMOD International Conference on the Management of Data, 1984.

....the relational data models are extended or are provided with built in extensibility to accommodate solutions to image related problems. In such systems, the images are either treated as complex or unformatted data by incorporating features such as variable length arrays, procedure fields, ADT s [2, 3] and BLOBS [4] Non first normal form (NF 2 ) relational model [5] was also introduced to provide support for complex data types and some implementations were reported [6, 7, 8] In a feature based CBIR, images are represented by their contents and the comparison is made between the contents of ....

M. Stonebraker, E. Anderson, E. Hanson, and B.Rubenstein, "Quel as a Datatype," Tech. Rep. UCB/ERL M83/73, University of California, Berkeley, 1983.

....data model are described next. 2. 4 Extended Conventional Data Models There has been a great interest in providing several extensions to the relational data model to overcome the limitations imposed by the flat tabular structure of relations for geometric modeling and engineering applications [45, 32]. The resulting data model is characterized by the addition of application specific components to an existing database system kernel. They include nested relations, procedural fields, and query language extensions for transitive closure, among others. The primary objective of all these extensions ....

Stonebraker, M., Anderson, E., Hanson, E. and Rubenstein, B. (1983b), "QUEL as a Datatype," UCB/ERL M83/73, University of California, Berkeley.

....) The definition of P (N p , E p , n p , e p , Y p ) is similar to the definition of G (N, E, n, e, Y) Figure II.1) Two components of a constraint can be defined on this graph: temporal functions and spatial functions. Temporal functions: Temporal functions are defined as calculated attributes [13] with the qualification: Time. Let us define T as a generic domain for time data. Let us define T as the closed difference operator between two elements defined on T. Let us denote T the undefined value on T (whenever Time attributes are not available in the database schema) The application ....

Stonebraker M, Aderson E, Hanson E, Rubenstein B: QUEL as a Data Type, Proc. ACM SIGMOD Conference, Boston, USA, June 1984

....allow going back and forth between queries and their representation. Moreover, the representation of queries is chosen so that it may be manipulated without introducing new data structures to SQL. In the field of databases, storing programs as data was initially investigated by Stonebraker et al. [15, 16] where they proposed a system that allowed programs to be stored as strings in tuple components and executed dynamically. Van den Bussche et al. [18] took this one step further by not only encoding programs as data, but also allowing manipulation of these encodings before evaluation. The true power ....

Stonebraker, M., Anderson, E., Hanson, E., and Rubenstein, B. QUEL as a data type. In Proceedings of ACM-SIGMOD 1984 International Conference on Management of Data, Boston (1984), B. Yormark, Ed., vol. 14:2 of SIGMOD Record, ACM Press, pp. 208--214.

....The mechanisms include: 1) abstract data types (ADT s) 2) data of type procedure, and 3) rules. These mechanisms can be used to support complex objects or to implement a shared object hierarchy for an object oriented programming language [Row86] Most of these ideas have appeared elsewhere [Ste84, Sto85, Sto86a, Sto86b]. We have discovered that some semantic constructs that were not directly supported can be easily added to the system. Consequently, we have made several changes to the data model and the syntax of the query language that are documented here. These changes include providing support for primary ....

M. R. Stonebraker and et. al., "QUEL as a Data Type", Proc. 1984 ACM-ACMSIGMOD Conf. on Management of Data Conf. on the Mgt. of Data, May 1984.

....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 83 0254 and the Naval 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 ....

....in a wide variety of circumstances. 3. THE QUERY LANGUAGE, QUEL In order to make procedures a useful construct, several extensions must be made to QUEL and these are indicated in the next several subsections. This language, QUEL , contains slight modifications to the facilities proposed in [STON84], and a concise summary of its extensions to QUEL appears in Appendix 1. 3.1. Execution of the Data A procedural field can be interpreted in two ways, namely it has a definition which is the QUEL code in the field and a value which is obtained by executing the QUEL commands. Since a user needs ....

Stonebraker, M. et. al., "QUEL as a Data Type," Proc. 1984 ACMSIGMOD Conference on Management of Data, Boston, Mass., June 1984.

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