Search vs. Query

By | 2011/07/13

Search and query are two different things, yet many criticisms of search seem to assume that it should behave like query. It shouldn’t, and we would be poorer if it did.

I am, of course, using the words “search” and “query” in a somewhat specialized sense here. By query, I mean a formal database query, which is addressed in formal terms to a specific data set. Queries are expressed in formal query languages such as SQL or XQuery. A search, on the other hand, is a string typed into a search box.

Behind the scenes, of course, the search engine is executing queries to fulfill the search request, but those queries are being executed against structured indexes of unstructured content. You can’t directly execute a structured query against unstructured data.

Advanced search forms (also called parametric or faceted search) bring many query-like features to search, but advanced search forms are often difficult to use because you usually don’t know exactly what the various form fields mean or what values to put into them. That is the problem with queries. To write an effective query, you have to have a pretty good knowledge of the structure and content of the database you are querying.

So which is better, query or search?

One of the most frequent complaints about search is that it is not precise enough. Properly written queries, on the other hand, are completely precise. A query will give you exactly the result you ask for. Exactly what you asked for, which may or not be exactly what you want. The hardest part of a query is asking the right question.

Search, on the other hand, is not precise. A dumb search just gives you a randomly ordered list of items in which your search term occurs. A smart search will provide you a ranked list of items that are strongly related to the search terms you entered, even if they do not match the exactly. This means that even though some of the results will doubtless be unrelated, and sometimes absurd, there is a very good chance that there is data you can use pretty high up in those results, even if you didn’t ask quite the right question. And there may well be relevant data you didn’t even think to ask for.

Being smart in this way is a key benefit of search. Queries cannot be smart. Queries must always give you exactly what you asked for. There can be no tolerance for serendipity in query results. Search can be smart, but query must be dumb and strictly obedient.

So that means search is better, right?

Not so fast. Queries have a very important quality: because they are precise, they are also reliable. This means that if your data is well structured and your queries are properly written, you don’t have to inspect the data before you use it.  This is hugely important. Most of modern commerce and industry would grind to a halt if human inspection of every query result was required. Queries allow you to specify the behavior of information systems by rule, and those rules can be executed unattended, making vast amounts of automation possible.

Any operation on content can be executed either by rule or by inspection. Operations that require human inspection of data are vastly more expensive than operations that are executed by computers following reliable rules. Queries may be dumber than searches, but, when put to work, they are much much faster.

So queries are better?

It’s not that simple. Queries are fast, but they require precise questions asked of precisely structured data. You can’t query the internet, because the internet is not precisely structured, and you don’t know enough about its content or structure to ask a precise question.  The semantic web initiative is essentially an attempt to create a web that can be queried. It is easy to understand the appeal of this project, but the difficulties are formidable.

Similarly, readers cannot really be expected to query a help system. They do not have enough information, and few have the appropriate experience. Nor are most help systems structured enough to make querying practical. Providing a more intelligent search engine would be a much more practical and effective option. A help system — something that people consult in some state of puzzlement — is exactly where search’s smartness is more valuable than query’s precision.

On the other hand, technical writers could benefit from making a much greater use of queries in their content management activities. The great advantage of queries is that they allow you to process data by rule, without the need to inspect the data. There are a number of content management activities, noticeably reuse and linking, that are generally done by inspecting the content in the content management system. Many writers complain that they spend many hours in the CMS mapping reuse and linking by inspection. If those activities could be done by rule using queries, large amounts of time could be saved. More on that later.

Category: Content Strategy Structured writing Tags: , ,

About Mark Baker

I am an aspiring novelist and former technical writer and content strategist. On the technical side, I am the author of Every Page is Page One: Topic-based Writing for Technical Communication and the Web and Structured Writing: Rhetoric and Process. I blog at everypageispageone.com and tweet as @mbakeranalecta. I am represented by Sam Hiyate and Victoria Loder of The Rights Factory.

5 thoughts on “Search vs. Query

  1. wordwhacky

    Excellent article, it sums up the nuances of search and query.

    I think query is the future of search. As technical writers, it is our responsibility to make the content query ready. How we achieve query ready content lies in the metadata.

    Thank you for the good read.

    Reply
    1. Mark Baker Post author

      Hi wordwhacky,

      Thanks for the comment. Certainly, on the production side we would benefit greatly from making our content query ready. On the delivery side, though, I think search will remain king. The problem on the delivery side is not to make the content capable of being queried, but to make the reader capable of forming useful queries.

      Reply
  2. Yuriy Guskov

    Search Vs. Query is full analogy of General Vs. Specific, which inherent to everything where we confront human-friendly forms (usually, it is natural language) and computer-friendly forms. You correctly noticed in one of your posts that computers force us to make data precise, to set exact correspondence for symbols, etc. But I see the biggest problem that there is no bridge between general and specific forms, a sort of compromise, ability to balance and make data more general or more specific, when we need it. And who said it is impossible? In fact, high-level programming languages is such a form, hypertext is too.

    Today, to use queries instead of search, you need to know rules, that is, a sort of metadata. To use search instead of queries, an application should provide a sort of “flat” access to data (as if, all data is plain text). It is not enough, and it may require resources and be difficult to implement. One of possible solution is fine-grained compatibility (you may see it as “one field compatibility”) vs. monolithic formats, which consists of a lot of metadata. Of course, it should be supported by identification, which would allow to make plain text more precise and make data more general.

    Reply
    1. Mark Baker Post author

      Yuri,
      Thanks for the comment. Have you read David Weinberger’s Everything is Miscellaneous? He has much to say on the virtues of the general and the flat, and on the useful limits of the specific and the structured.

      Reply
  3. John

    Thanks for sharing this is one of the best clarification on the two terms.

    Reply

Leave a Reply