We consider a database with one target item. Partial search is designed to find a part of the database [a block]
containing the target item. After a user finds the target block he/she might want to make another partial search:
subdivide the target block into sub-blocks and look for a sub-block containing the target item. An example: if
we need to go to a hotel, we first look at a State map [to find highways] and then at a town map [to find a local
approach to the hotel]. Number of queries necessary for sequential searches is calculated in the paper. Sequential
partial search can be done faster the first one.
Conference Committee Involvement (10)
Quantum Information and Computation XV
20 April 2016 | Baltimore, MD, United States
Quantum Information and Computation XIII
22 April 2015 | Baltimore, MD, United States
Quantum Information and Computation XII
8 May 2014 | Baltimore, MD, United States
Quantum Information and Computation XI
2 May 2013 | Baltimore, Maryland, United States
Quantum Information and Computation X
26 April 2012 | Baltimore, Maryland, United States
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.