Query by Example (QBE) is a database query language for relational databases. It was devised by Moshé M. Zloof at IBM Research during the mid-1970s, in parallel to the development of SQL.[1] It is the first graphical query language, using visual tables where the user would enter commands, example elements and conditions. Many graphical front-ends for databases use the ideas from QBE today. Originally limited only for the purpose of retrieving data, QBE was later extended to allow other operations, such as inserts, deletes and updates, as well as creation of temporary tables.
The motivation behind QBE is that a parser can convert the user's actions into statements expressed in a database manipulation language, such as SQL. Behind the scenes, it is this statement that is actually executed. A suitably comprehensive front-end can minimize the burden on the user to remember the finer details of SQL, and it is easier and more productive for end-users (and even programmers) to select tables and columns by selecting them rather than typing in their names.
In the context of information retrieval, QBE has a somewhat different meaning. The user can submit a document, or several documents, and ask for "similar" documents to be retrieved from a document database [see search by multiple examples<ref>{{Cite book|last1=Zhu|first1=Mingzhu|last2=Wu|first2=Yi-Fang Brook|title=Proceedings of the 7th ACM international conference on Web search and data mining |chapter=Search by multiple examples |date=2014-02-24|publisher=ACM|pages=667–672|doi=10.1145/2556195.2556206|isbn=9781450323512|s2cid=8397529 }}</ref>]. Similarity search is based comparing document vectors (see Vector Space Model).
QBE represents seminal work in end-user development, frequently cited in research papers as an early example of this topic.
Currently, QBE is supported in several relational database front ends, notably Microsoft Access, which implements "Visual Query by Example", as well as Microsoft SQL Server Enterprise Manager. It is also implemented in several object-oriented databases (e.g. in db4o).
QBE is based on the logical formalism called tableau query, although QBE adds some extensions to that, much like SQL is based on the relational algebra.
An example using the Suppliers and Parts database is given here to illustrate how QBE works.
| P.SX | J. DOE | ROME |
The term also refers to a general technique influenced by Zloof's work whereby only items with search values are used to "filter" the results. It provides a way for a software user to perform queries without having to know a query language (such as SQL). The software can automatically generate the queries for the user (usually behind the scenes). Here are some examples:
Example Form B: .....Name: Bob ..Address: .....City: ....State: TX ..Zipcode:
Resulting SQL:
Resulting SQL:
Another approach to text comparisons is to allow one or more wildcard character characters. For example, if an asterisk is designated as a wild wildcard character in a particular system, then searching for last names using "Rob*" would return (match) last names such as "Rob", "Robert", "Robertson", "Roberto", etc.