SIBRIS (Sandwich Interactive Browsing and Ranking In formation System) is an interactive text retrieval system which has been developed to support the browsing of library and product files at Pfizer Central Research. Once an initial rank ing has been produced, the system will allow the user to select any document displayed on the screen at any point during the browse and to use that as the basis for another search. Facili ties have been included to enable the user to keep track of the browse and to facilitate backtracking, thus allowing the user to move away from the original query to wander in and out of different areas of interest.
Get full access to this article
View all access options for this article.
References
1.
D. Bawden , Information systems for the stimulation of creativity, Journal ofInformation Science12 (1986) 203-216.
2.
R.S. Boyer and J.S. Moore, A fast string searching algorithm, Communications of theACM20 (1977 ) 762-772.
3.
C. Cleverdon , Optimising convenient online access to bibliographic databases, Information Services and Use4 (1984) 37-47.
4.
W.B. Croft , Experiments with automatic text filling and retneval in the office environment, ACM SIGIR Forum16 (1982) 2-9.
5.
C. Faloutsos and S. Chnstodoulakis, Design considerations for a message file server, IEEE Transactions on Software Engineering10 (1984) 201-210.
6.
M.C. Harrison , Implementation of substring search by hashing, Communications of theACM14 (1971) 777-779.
7.
I.G. Hendry , P. Willett and F.E. Wood, INSTRUCT: a teaching package for experimental methods in information retrieval. Part 1. The users' view, Program20 (1986) 245-263.
8.
I.G. Hendry , P. Willett and F.E. Wood, INSTRUCT: a teaching package for experimental methods in information retrieval. Part 2. Computational aspects, Program20 (1986) 382-393.
9.
C.R. Hildreth .Online browsing support capabilities, Proceedings of the ASIS Annual Meeting19 (1982) 127-132.
10.
D.E. Knuth, The Art of Programming, Vol. 3: Searching and Sorting ( Addison-Wesley, Reading, MA, 1973 ).
11.
J. Martin, Computer Data Base Organisation (Prentice-Hall, Englewood Cliffs, NJ, 1977).
12.
K.C. Mohan and P. Willett, Nearest neighbour searching in serial files using text signatures, Journal ofInformation Science11 (1985) 31-39.
13.
P.L. Noerr and K.T. Bivens-Noerr, Browse and navigate: an advance in database access methods, Information Processing and Management21 (1985) 205-213.
14.
T. Noreault , M. Koll and M.J. McGill, Automatic ranked Boolean output in SIRE , Journal of the Amencan Society for Information Science28 (1977) 333-339.
15.
S.A. Perry and P. Willett, A review of the use of inverted files for best match searching in information retrieval systems, Journal ofInformation Science6 (1983) 59-66.
16.
M.F. Porter , An algorithm for suffix stripping, Program14 (1980) 130-137.
17.
C.S. Roberts , Partial match retrieval via the method of superimposed codes, Proceedings of the IEEE67 (1979) 1624-1642.
18.
R. Sacks-Davis and K. Ramamohanarao, A two-level superimposed coding scheme for partial match retrieval, Information Systems8 (1983) 273-280.
19.
G. Salton and M.J. McGill.Introduction to Modern Information Retrieval ( McGraw-Hill, New York, 1983).
20.
E.J. Schuegraf , Signature searching: a review of theory and application, Canadian Journal of Information Science12 (1987) 22-35.
21.
K. Sparck Jones, A statistical interpretation of term specificity and its application in retrieval, Journal of Documentation28 (1972) 11-21.
22.
S.J. Wade, PhD thesis in preparation (Department of Information Studies , University of Sheffield, 1989).
23.
S.J. Wade and P. Willett, INSTRUCT: a teaching package for experimental methods in information retneval. Part 3. Browsing, clustering and query expansion , Program22 (1988 ) 44-61.
24.
P. Willett , V. Winterman and D. Bawden, Implementation of nearest-neighbour searching in an online chemical structure search system, Journal of Chemical Information and Computer Science26 (1986) 36-41.
