Showing papers on "Web query classification published in 1983"
01 Jul 1983-International Journal of Human-computer Studies \/ International Journal of Man-machine Studies
TL;DR: The generalized Boolean query model must be reconciled with the vector space approach, suggested new lattice structures for weighted retrieval, and probabilistic retrieval models, and proper retrieval evaluation mechanisms reflecting the fuzzy nature of retrieval are needed.
Abstract: Substantial work has been done on the application of fuzzy subset theory to information retrieval. Boolean query processing has been generalized to allow for weights to be attached to individual terms, in either the document indexing or the query representation, or both. Problems with the generalized Boolean lattice structure have been noted, and an alternative approach using query thresholds and appropriate document evaluation functions has been suggested. Problems remain unsolved, however. Criteria generated for the query processing mechanism are inconsistent. The exact functional form and appropriate parameters for the query processing mechanism must be specified. Moreover, the generalized Boolean query model must be reconciled with the vector space approach, suggested new lattice structures for weighted retrieval, and probabilistic retrieval models. Finally, proper retrieval evaluation mechanisms reflecting the fuzzy nature of retrieval are needed.
137 citations
Patent•
IBM1
TL;DR: In this paper, a linear query for accessing a relation data base in computer storage is synthesized from a graphic query input at a user terminal, which may be one of a combined print query, a target print query or target print queries, an insert query, an delete query, or an update query.
Abstract: A linear query for accessing a relation data base in computer storage is synthesized from a graphic query input at a user terminal. The graphic query may be one of a combined print query, a target print query, an insert query, a delete query, or an update query. According to one embodiment, the linear query is expressed in Structured Query Language (SQL) syntax, and the graphic query in Query By Example (QBE) syntax. Responsive to a QBE combined print query or target print query, an SQL select query is generated comprising the UNION of one or more generated select statements. Responsive to a QBE delete query, an SQL delete query is generated from the logical OR of generated condition statements including an outer query DELETE and a SELECT* subquery. Responsive to a QBE update query, an SQL update query is generated including a SET clause and any generated WHERE clause and subquery. Responsive to a QBE insert query, an SQL insert query is generated to include an INSERT statement and any generated SELECT statement.
103 citations
Proceedings Article•
1 Dec 1983TL;DR: A new and distinct variety of miniature rose plant of hardy, dwarf, bushy, upright, much branched habit, as illustrated and described, characterized by buds and flowers which are striped (variegated) in varying proportions of red and white of a color combination resembling Ferdinand Pichard.
84 citations
TL;DR: An approach to processing distributed queries that makes explicit use of redundant data is proposed and the role of data redudancy in maximizing parallelism and minimizing data movement is clarified.
Abstract: In this paper an approach to processing distributed queries that makes explicit use of redundant data is proposed. The basic idea is to focus on the dynamics of materialization, defined as the collection of data and partial results available for processing at any given time, as query processing proceeds. In this framework the role of data redudancy in maximizing parallelism and minimizing data movement is clarified. What results is not only the discovery of new algorithms but an improved framework for their evaluation.
24 citations
TL;DR: An iterative method for information retrieval uses searchonyms found from the previously retrieved set of documents in query expansion to form the feedback seed, which is subsequently used in query reformulation.
Abstract: An iterative method for information retrieval is presented. It uses searchonyms found from the previously retrieved set of documents in query expansion. Only largest values of relation of resemblance between the query and the documents are used to form the feedback seed. From this top retrieved set of documents, most informative features are selected as searchonyms, which are subsequently used in query reformulation. Large operational bibliographic data bases are used to simulate the behavior of this method.
7 citations
7 Dec 1983
TL;DR: The idea of auser topology is presented as the basis for a query optimization algorithm and the effects of a user's query constraints on the user topology are illustrated.
Abstract: The current research on optimizing algorithms for queries in distributed data base networks is presented. An identification of additional factors which add cost and time to processing of a query both at a node and in the transporting of data along a link in the network is given. The idea of a user topology is presented as the basis for a query optimization algorithm and the effects of a user's query constraints on the user topology are illustrated. With the influencing factors on a query request identified, a model of query processing is described.
6 citations
Proceedings Article•
1 Jan 1983
4 citations
TL;DR: The purpose of the evaluation framework presented here is to help guide the design of human factors experiments to decide on an appropriate choice for a given query language.
2 citations