fbpx
Wikipedia

Delimited search

In computing, delimited search refers to a search user interface in which the user must type their query in full before initiating a search and receiving results. This is in contrast to incremental search, in which results are displayed to the user as they type their query.

Critique edit

Interface design expert Jef Raskin critiqued delimited search (compared to incremental search) in his book The Humane Interface:

With a delimited search, the computer waits for the user to type a pattern and delimit it, after which it is the user who waits while the computer does the search. When using a delimited search the user must guess, beforehand, how much of a pattern the computer needs to distinguish the desired target from other, similar targets. With an incremental search, he can tell when he has typed enough to disambiguate the desired instance, because the target appeared on the display. (..) In spite of near agreement about the desirability of incremental searches on the part of both designers and users, almost all interface-building tools make it easy to implement delimited searches and difficult or impossible to implement incremental searches.[1]

References edit

  1. ^ Raskin, Jef (2000-04-08). The Humane Interface. Addison-Wesley Professional. pp. 126. ISBN 978-0-201-37937-2. Read Text on Internet Archive

External links edit

  • If It Isn't Incremental, It's Excremental 2009-07-13 at the Wayback Machine — Programming and Human Factors by Jeff Atwood.


delimited, search, this, article, relies, largely, entirely, single, source, relevant, discussion, found, talk, page, please, help, improve, this, article, introducing, citations, additional, sources, find, sources, news, newspapers, books, scholar, jstor, mar. This article relies largely or entirely on a single source Relevant discussion may be found on the talk page Please help improve this article by introducing citations to additional sources Find sources Delimited search news newspapers books scholar JSTOR March 2024 In computing delimited search refers to a search user interface in which the user must type their query in full before initiating a search and receiving results This is in contrast to incremental search in which results are displayed to the user as they type their query Critique editInterface design expert Jef Raskin critiqued delimited search compared to incremental search in his book The Humane Interface With a delimited search the computer waits for the user to type a pattern and delimit it after which it is the user who waits while the computer does the search When using a delimited search the user must guess beforehand how much of a pattern the computer needs to distinguish the desired target from other similar targets With an incremental search he can tell when he has typed enough to disambiguate the desired instance because the target appeared on the display In spite of near agreement about the desirability of incremental searches on the part of both designers and users almost all interface building tools make it easy to implement delimited searches and difficult or impossible to implement incremental searches 1 References edit Raskin Jef 2000 04 08 The Humane Interface Addison Wesley Professional pp 126 ISBN 978 0 201 37937 2 Read Text on Internet ArchiveExternal links editIf It Isn t Incremental It s Excremental Archived 2009 07 13 at the Wayback Machine Programming and Human Factors by Jeff Atwood nbsp This article related to a type of software is a stub You can help Wikipedia by expanding it vte Retrieved from https en wikipedia org w index php title Delimited search amp oldid 1218496274, wikipedia, wiki, book, books, library,

article

, read, download, free, free download, mp3, video, mp4, 3gp, jpg, jpeg, gif, png, picture, music, song, movie, book, game, games.