| Zloof M. M., "Query-by-Example: A Data Base Language.", IBM Systems Journal, vol. 16, num. 4, 1977, p. 324-343. |
....i Figure 2: Example of a nested table. also describes QSByE (Querying Semistructured data By Example) 13, 15] which shows the feasibility of using nested tables for representing and querying semistructured Web data . QSByE combines features of QBE (Query By Example) [32] with typical features of query languages for semistructured data [2, 5] As implemented, QSByE provides the structure of the data as a nested table skeleton [23] so that users do not have to uncover the structure of the data by themselves. It also lets users restructure provided nested tables to ....
....In this case, the unnest operation cannot be executed because it would generate a result whose scheme would not conform with Definition 1. 5 QSByE In this section, we present QSByE (Querying Semistructured data By Example) 13, 15] a query interface that adopts a variation of the QBE paradigm [32]. QSByE combines features of query languages for semistructured data, such as type coercion and path expressions, with features of the original QBE language to query semistructured Web data extracted by the DEByE tool [20, 28] When using QSByE, users formulate their queries by means of graphical ....
ZLOOF, M. M. Query-by-Example: A Data Base Language. IBM Systems Journal 16, 4 (1977), 324-343. 17
....their information needs, expression based queries are often too complicated. The popularity of the QBE type (Query by Example) graphical query languages of relational databases shows that the use of the table schemas as templates in queries helps the end users to specify their information needs [15,16]. An example of a graphical text retrieval language using a hierarchic structure description as a template is LQL [17] LQL is designed, however, for a specific application: dictionary entries. In [18] we have defined a model to describe information interests of a user for structured text in a ....
M.M. Zloof, `Query-by-example: a database language', IBM System Journal, 16(4), 324--343, (1977).
....and computation on domain values fit in naturally. We believe that FC could form a more elegant basis for language development than standard relational algebra when these features should be included. An interesting direction of research would be to explore the possibilities of a Query By Example [Zlo77] style query language, where the novice user could program via example data instead of factor directly; and especially instead of using the s and (i) s directly. If a language is going to form a basis for design of new languages, it is important to know the computational power of the language. ....
M. M. Zloof. Query-by-Example: a data base language. IBM Systems Journal, 16(4):324 343, 1977. 35
....data. We also introduce a set of query operations for semistructured data represented as an internally varying nested table and describe QSByE (Querying Semistructured data By Example) 3] a q ery interface that implements s ch operations. QSByE combines feat res of QBE (Query By Example)[6]withtyp ical feat res of q ery lang ag] for semistr ct red data, s ch as type coercion and path expressions [1] Partic larly, QSByE makes it possible to handle data extracted from Web pag6 by a tool called DEByE (Data Extraction By Example) 4] 2 Nested Tables with Structural Variants In ....
....it will split them into di#erent rows of the table. Otherwise, if it is applied to an internal table it will eliminate a level of nesting . These operations were implemented in QSByE (Querying Semistructured data By Example) 3] a q ery interface that adopts a variation of the QBE paradig m [6] to provide a s itable environment for cas al sers to q ery semistr ct red Web data. We ill strate how q eries are form lated with QSByE by means of an example of a q ery over the data in the nested table of Fig re 1. S ppose a ser is interested in issing the following q ery: List the title ....
Zloof, M. M. Query-by-Example: A Data Base Language. IBM Systems Journal 16, 4 (1977), 324--343. 720, 721
....relational calculus [2] As opposed to SQL where users have to conform to the phrase structure strictly, QBE users may enter any expression as an entry insofar as it is syntactically correct. That is, since the entries are bound to the table skeleton, the user can only specify admissible queries [17]. In this paper, we propose to use the established QBE as a user interface for writing trigger rules. Since most trigger rules are complex combinations of SQL This research is supported in part by DARPA contract No. N66001 97 C 8601 and SBIR F30602 99 C 0106. 2 Dongwon Lee, Wenlet Mao, Wesley ....
.... Related Work Past active database research has focused on active database rule language (e.g. 1] rule execution semantics (e.g. 6] or rule management and system architecture issues (e.g. 15] In addition, research on visual querying has been done in traditional database research (e.g. [7, 17]) To a greater or lesser extent, all these research focused on devising novel visual querying schemes to replace data retrieval aspects of SQL language. Although some have considered data definition aspects [3] or manipulation aspects, none have extensively considered the trigger aspects for SQL, ....
[Article contains additional citation context not shown here]
Zloof, M. M. "Query-by-Example: a data base language", IBM System J., 16(4):342-343, 1977.
....in the appropriate resource file. The system generally chooses the correct query when there is an obvious one. When the result is ambiguous, the system reports it and lets users clarify what they actually mean. This approach to visual querying can be contrasted to previous visual query languages [5,7,33], which either require too much knowledge of the underlying databases or are too schema oriented for our purposes. 5 SPECIFYING THE VISUALIZATION The second stage in generating complex software visualizations rapidly is to let the user select and define the appropriate visualization. The front ....
M. M. Zloof, "Query by Example: a data base language," IBM Systems J. Vol. 16(4) pp. 324-343 (1977).
....as new tuples of that class are added. The specification given by the user is mapped into a query when the user either asks to visualize the data or to check its consistency using a branch and bound approach. This approach to visual querying can be contrasted to previous visual query languages [4,6,33], which require much more knowledge of the underlying databases or are too schemaoriented for our purposes. Cacti also uses the above specification to allow the user to select an appropriate visualization. It first determines which visualizations are applicable to the chosen data, asks the user ....
M. M. Zloof, "Query by Example: a data base language," IBM Systems J. Vol. 16(4) pp. 324-343 (1977).
....Perspective The concept of Relational Algebra was first presented over 30 years ago ( Kuh67] Cod70] The goal was to establish a firm logical foundation for databases. A wave of query languages soon followed, including SQL( Cha76] and QUEL ( SWKH76] A language called Query By Example ([Zlo77]) was part of that generation. The goal of Query By Example (QBE) was to have users specify queries in a more natural environment than other algebraic languages. As a result, the author claimed a shorter learning period for new QBE users than for other languages. An example of a QBE query is shown ....
....are compiled into view definitions. All the source descriptions take place using a language or middleware model appropriate for self describing schemas with annotation. Because they have to handle non relational sources, all those models are Object Oriented. 10.1. 2 Intelligent Systems In [Zlo77] Zloof proposes a user friendly language suitable for describing relational queries. This system can be used for view definitions in the relational context. In [NAM98] Abiteboul et al. propose a statistical method to reduce semistructured data to a strongly typed system. Such a reduction must ....
Moshe Zloof. Query-by-example: a data base language. IBM Systems Journal, 1977. 62
....Color is the most frequent feature that is used in multimedia data querying and retrieval systems. The existing CBR systems are enriched with an easy to index data structure in order to facilitate the query processing. Specification of a sample query image is widely used in query by example [Zlo77] The images that are similar enough to the query image are retrieved from the database. As alternative to query by example, the users may specify the percentages of the color channels (e.g. red, green, blue for RGB color space) in the color space and form a color query. In this case, the images ....
M.M. Zloof. Query-by-example: a database language. IBM Syst. Journal, 16(4), 1977. 26
....have proven viable in other domains. The Spreadsheet is a prime example of an end user programming environment. The developer enters his programs (formulas) directly in table cells, so the programming is concrete and direct, and immediate feedback is provided. Query by example (QBE)[21] formulas from the database world are similar. The designer user enters query expressions directly in table cells, and the system automatically displays the rows that fit the expressions. In this way, the designer is shielded from the complexities of SQL and programming syntax in general. ....
Zloof, M.,"Query-by-Example: A Database Language", IBM Systems J., 21(3), 1977.
....sementics to integrete query end updetes thet we consider in order to model deductive object detebeses. U Detelog is e rule lenguege supporting decleretive specificetlon of updetes in progreta rules. The execution model of U Detelog consists of two pheses, the ruerking phese end the updete phese [60]. The first phese collects the updetes found during the eveluetion process, without, however, executing them. During the second phese the updetes ere executed eltogether only if they ere ground end consistent. If the set is not consistent the trensection is aborted end no updete in the set is ....
M. Zloof. Query-by-example: a Data Base Language. IBM Systems Journal, 16(4):324 343, 1977. 33
....in the environment of multi database systems as an interactive and successive definition of integrating views. Since the integration conflict resolution is a complex task an iterative process has to be considered. Therefore the single steps are created using a approach inspired by QbE [Zlo77] A table view is used to specify the integration task by giving examples and showing the integration results immediately. Thereby the special conflict resolution operation of FRAQL are taken into account. Additionally an iconic view of the integration graph is given which forms the view ....
M.M. Zloof. Query-by-Example: A Data Base Language. IBM Systems Journal, 16(4):324 -- 343, 1977.
....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 spatial query languages, it is most important to ....
Zloof, M.M., Query-by-Examples: A Data Base Language. IBM Systems J., 1977, Vol.16, No.4, pp.324-343.
No context found.
Zloof M. M., "Query-by-Example: A Data Base Language.", IBM Systems Journal, vol. 16, num. 4, 1977, p. 324-343.
No context found.
M.M. Zloof, "Query-by-Example: a Database Language", IBM Syst. Journal 16 (1977), 324-343.
No context found.
M. M. Zloof. Query by example -- a data base language. IBM Systems Journal, 16(4):324 -- 343, 1977.
No context found.
Zloof, M, Query-by-example: A Data Base Language. IBM Systems Journal, 16(4):324--343, 1977.
No context found.
Zloof, M, Query-by-example: A Data Base Language. IBM Systems Journal, 16(4):324--343, 1977.
No context found.
M.M.Zloof. Query-by-Example: A Database Language, IBM Syst. Journal, 16(4), 1977, 324-343.
No context found.
M.M. Zloof. Query-by-Example: a data base language. IBM Systems Journal, 16(4):324--343, 1977. 29
No context found.
M. M. Zloof. Query--by--example: A database language. IBM System Journal, 16(4):324--343, 1977.
No context found.
Zloof M. M. `Query-By-Example: A Data Base Language', IBM Systems Journal,
No context found.
M. M. Zloof. Query-by-example: A database language. IBM System Journal, 16(4):324--343, 1977.
No context found.
M. Zloof. Query-by-example: a database language. In IBM Systems Journal, 16(4):324-- 343, 1977. 56
No context found.
M. M. Zloof, `Query-by-example; a database language', IBM Syst. J., (1977).
First 50 documents Next 50
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