ACM Home Page
Please provide us with feedback. Feedback
SDLIP + STARTS = SDARTS a protocol and toolkit for metasearching
Full text PdfPdf (302 KB)
Source International Conference on Digital Libraries archive
Proceedings of the 1st ACM/IEEE-CS joint conference on Digital libraries table of contents
Roanoke, Virginia, United States
Pages: 207 - 214  
Year of Publication: 2001
ISBN:1-58113-345-6
Authors
Noah Green  Computer Science Dept., Columbia University
Panagiotis G. Ipeirotis  Computer Science Dept., Columbia University
Luis Gravano  Computer Science Dept., Columbia University
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 15,   Citation Count: 5
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/379437.379496
What is a DOI?

ABSTRACT

In this paper we describe how we combined SDLIP and STARTS, two comple mentary protocols for searching over distributed document collections. The resulting protocol, which we call SDARTS, is simple yet expressible enough to enable building sophisticated metasearch engines. SDARTS can be viewed as an instantiation of SDLIP with metasearch-specific elements from STARTS. We also report on our experience building three SDARTS-compliant wrappers: for locally available plain-text document collections, for locally available XML document collections, and for external web-accessible collections. These wrappers were developed to be easily customizable for new collections. Our work was developed as part of Columbia University's Digital Libraries Initiative--Phase 2 (DLI2) project, which involves the departments of Computer Science, Medical Informatics, and Electrical Engineering, the Columbia University libraries, and a large number of industrial partners. The main goal of the project is to provide personalized access to a distributed patient-care digital library.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
International Standard Maintenance Agency. Z39.50 Maintenance Agency Page. Accessible at http://www.loc.gov/z3950/agency/. ISMA, 2000.
 
2
C. Blake and C. Merz. University of California at Irvine repository of machine learning databases. Accessible at http://kdd.ics.uci.edu/.
 
3
C. M. Bowman, P. B. Danzig, D. R. Hardy, U. Manber, and M. F. Schwartz. Harvest: A scalable, customizable discovery and access system. Technical Report CU-CS-732-94, Department of Computer Science, University of Colorado-Boulder, Aug. 1994.
4
5
 
6
7
 
8
 
9
E. Christian. Application profile for the government information locator service GILS, Version 2, Aug. 1997. Accessible at http://www.usgs.gov/gils/prof v2.html.
10
11
12
13
 
14
HTML Tidy. Accessible at http://www.w3.org/People/Raggett/tidy/, 2000.
15
16
 
17
The Lucene Search Engine. Accessible at http://www.lucene.com/, 2000.
 
18
 
19
Open Archives Initiative. Accessible at http://www.openarchives.org/, 2000.
 
20
A. Paepcke, R. Brandriff, G. Janee, R. Larson, B. Ludaescher, S. Melnik, and S. Raghavan. Search middleware and the Simple Digital Library Interoperability Protocol. D-Lib Magazine, 6(3), 2000.
 
21
 
22
E. M. Voorhees, N. K. Gupta, and B. Johnson-Laird. The collection fusion problem. In Overview of the Third Text REtrieval Conference (TREC-3), pages 95-104. Department of Commerce, National Institute of Standards and Technology, Mar. 1995.
 
23
S. Weibel, J. Godby, E. Miller, and R. Daniel Jr. OCLC/NCSA metadata workshop report, 1995. Accessible at http://www.oclc.org:5047/oclc/- research/publications/weibel/metadata/- dublin core report.html.
24


Collaborative Colleagues:
Noah Green: colleagues
Panagiotis G. Ipeirotis: colleagues
Luis Gravano: colleagues