Distributed active catalogs and meta-data caching in descriptive name services

Ordille, Joann J.; Miller, P.B.

doi:10.1109/icdcs.1993.287716

Cited by 15 publications

(8 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this context, researchers have investigated common resource description languages [29], schemes for repository selection [12] and merger of ranked lists [36]. Heterogeneity in search interfaces has led implementors to converge on mediator-based architectures [1,3,23] in which wrappers for each participant repository rewrite the query and interpret the ranked lists returned.…”

Section: Overviewmentioning

confidence: 99%

Sets

Bawa

Manku

Raghavan³

2003

Proceedings of the 26th Annual International ACM SIGIR Conference on Research and Development in Informaion Retrieval

117

View full text Add to dashboard Cite

We present SETS, an architecture for efficient search in peer-to-peer networks, building upon ideas drawn from machine learning and social network theory. The key idea is to arrange participating sites in a topic-segmented overlay topology in which most connections are short-distance, connecting pairs of sites with similar content. Topically focused sets of sites are then joined together into a single network by long-distance links. Queries are matched and routed to only the topically closest regions. We discuss a variety of design issues and tradeoffs that an implementor of SETS would face. We show that SETS is efficient in network traffic and query processing load.

show abstract

Section: Overviewmentioning

confidence: 99%

Sets

Bawa

Manku

Raghavan³

2003

Proceedings of the 26th Annual International ACM SIGIR Conference on Research and Development in Informaion Retrieval

117

View full text Add to dashboard Cite

show abstract

“…The generator objects associated with the brokers are gathered by a "directory of servers," which is queried initially by the users to obtain a list of the brokers whose generator rules match the given query; see also Danzig et al [1991]. Barbará and Clifton [1992], Ordille and Miller [1992], and Simpson and Alonso [1989] are other examples of this approach, in which users query "metainformation" databases.…”

Section: Related Workmentioning

confidence: 99%

GlOSS

Gravano

García-Molina

Tomasic

1999

ACM Trans. Database Syst.

218

149

View full text Add to dashboard Cite

The dramatic growth of the Internet has created a new problem for users: location of the relevant sources of documents. This article presents a framework for (and experimentally analyzes a solution to) this problem, which we call the text-source discovery problem. Our approach consists of two phases. First, each text source exports its contents to a centralized service. Second, users present queries to the service, which returns an ordered list of promising text sources. This article describes GlOSS, Glossary of Servers Server, with two versions: bGlOSS, which provides a Boolean query retrieval model, and vGlOSS, which provides a vector-space retrieval model. We also present hGlOSS, which provides a decentralized version of the system. We extensively describe the methodology for measuring the retrieval effectiveness of these systems and provide experimental evidence, based on actual data, that all three systems are highly effective in determining promising text sources for a given query.

show abstract

“…SNQP was specifically designed for use with the Nomenclator name and information service [8,7,5]. Nomenclator produces query responses by integrating information from data repositories with different protocols and data formats.…”

Section: ------------------------------------------------------------mentioning

confidence: 99%

Simple Nomenclator Query Protocol (SNQP)

Elliott¹,

Ordille²

1998

View full text Add to dashboard Cite

Distributed active catalogs and meta-data caching in descriptive name services

Cited by 15 publications

References 11 publications

Sets

Sets

GlOSS

Simple Nomenclator Query Protocol (SNQP)

Contact Info

Product

Resources

About