The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
VAGUE: a user interface to relational databases that permits vague queries
Open accessAbstract
A specific query establishes a rigid qualification and is concerned only with data that match it precisely. A vague query establishes a target qualification and is concerned also with data that are close to this target. Most conventional database systems cannot handle vague queries directly, forcing their users to retry specific queries repeatedly with minor modifications until they match data that are satisfactory. This article describes a system called VAGUE that can handle vague queries directly. The principal concept behind VAGUE is its extension to the relational data model with data metrics, which are definitions of distances between values of the same domain. A problem with implementing data distances is that different users may have different interpretations for the notion of distance. VAGUE incorporates several features that enable it to adapt itself to the individual views and priorities of its users.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,320
Introduction to Modern Information Retrieval
Salton, G., & McGill, M. J. (1983) · Virtual Defense Library (Ministerio de Defensa) · Cited by 11,390
A relational model of data for large shared data banks
Codd, E. F. (1970) · Communications of the ACM · doi:10.1145/362384.362685 · Cited by 5,547
A relational model of data for large shared data banks
Codd, E. F. (1983) · Communications of the ACM · doi:10.1145/357980.358007 · Cited by 4,796
Introduction to Database Systems
(2006) · Foundations of Database Design · doi:10.1201/9781420003345.ch1 · Cited by 3,521
The SMART Retrieval System—Experiments in Automatic Document Processing
Salton, G. (1971) · CERN Document Server (European Organization for Nuclear Research) · Cited by 2,252
Query-by-Example: A data base language
Zloof, M. M. (1977) · IBM Systems Journal · doi:10.1147/sj.164.0324 · Cited by 877
A fuzzy representation of data for relational databases
Buckles, B. P., & Petry, F. E. (1982) · Fuzzy Sets and Systems · doi:10.1016/0165-0114(82)90052-5 · Cited by 605
Principles of Data Base Systems
Ullman, J. D. (1980) · Cumulative Index of Computer Aided Architectural Design · Cited by 426
Pictures of relevance: A geometric analysis of similarity measures
Jones, W. P., & Furnas, G. W. (1987) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(198711)38:6<420::aid-asi3>3.0.co;2-s · Cited by 244
Herot, C. F. (1980) · ACM Transactions on Database Systems · doi:10.1145/320610.320648 · Cited by 206
Implementing imprecision in information systems
Zemankova, M., & Kandel, A. (1985) · Information Sciences · doi:10.1016/0020-0255(85)90008-8 · Cited by 161
Williams, M. D. (1984) · International Journal of Man-Machine Studies · doi:10.1016/s0020-7373(84)80052-8 · Cited by 159
Cooperative responses from a portable natural language query system
Kaplan, S. J. (1982) · Artificial Intelligence · doi:10.1016/0004-3702(82)90035-2 · Cited by 158
Order dependency in the relational model
Ginsburg, S., & Hull, R. B. (1983) · Theoretical Computer Science · doi:10.1016/0304-3975(83)90084-1 · Cited by 108
BAROQUE: a browser for relational databases
Motro, A. (1986) · ACM Transactions on Information Systems · doi:10.1145/6168.6172 · Cited by 63
Self-citationOn the applied use of human memory models: the memory extender personal filing system
Jones, W. (1986) · International Journal of Man-Machine Studies · doi:10.1016/s0020-7373(86)80076-1 · Cited by 42
Cited by
Efficient similarity search in sequence databases
Agrawal, R., Faloutsos, C., & Swami, A. (1993) · Lecture Notes in Computer Science · doi:10.1007/3-540-57301-1_5 · Cited by 1,979
Efficient query evaluation on probabilistic databases
Dalvi, N., & Suciu, D. (2007) · The VLDB Journal · doi:10.1007/s00778-006-0004-3 · Cited by 962
A probabilistic relational algebra for the integration of information retrieval and database systems
Fuhr, N., & Rölleke, T. (1997) · ACM Transactions on Information Systems · doi:10.1145/239041.239045 · Cited by 396
Metadata
- Authors
- Motro, A.
- Venue
- ACM Transactions on Information Systems
- Published
- 1988-07
- Volume
- 6
- Issue
- 3
- Pages
- 187-214
- ISSN
- 1046-8188 (ISSN-L)
- 1558-2868
- OpenAlex
- W2108699731
- Cited by
- 295
- References
- 17
- FWCI
- 7.38
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.