Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Lewis Church Jr.

dblp:45/2668 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2005
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1Databases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval
distributed information retrieval
0.012004
Information Retrieval with Distributed Databases: Analytic Models of Performance · IEEE Trans. Parallel Distributed Syst. 2004
Information retrieval › distributed information retrieval
result fusion
0.012004
Information Retrieval with Distributed Databases: Analytic Models of Performance · IEEE Trans. Parallel Distributed Syst. 2004
Performance modeling and evaluation
analytical modeling
0.012004
Information Retrieval with Distributed Databases: Analytic Models of Performance · IEEE Trans. Parallel Distributed Syst. 2004
YearPublicationVenuePosition
2005 Are two document clusters better than one? The Cluster Performance Question for information retrieval
abstract
Abstract When do information retrieval systems using two document clusters provide better retrieval performance than systems using no clustering? We answer this question for one set of assumptions and suggest how this may be studied with other assumptions. The “Cluster Hypothesis” asks an empirical question about the relationships between documents and user‐supplied relevance judgments, while the “Cluster Performance Question” proposed here focuses on the when and why of information retrieval or digital library performance for clustered and unclustered text databases. This may be generalized to study the relative performance of m versus n clusters.
Robert M. Losee, Lewis Church Jr.
J. Assoc. Inf. Sci. Technol.2
2004 Information Retrieval with Distributed Databases: Analytic Models of Performance
abstract
The major emphasis is on analytical techniques for predicting the performance of various collection fusion scenarios. Knowledge of analytical models of information retrieval system performance, both with single processors and with multiple processors, increases our understanding of the parameters (e.g., number of documents, ranking algorithms, stemming algorithms, stop word lists, etc.) affecting system behavior. While there is a growing literature on the implementation of distributed information retrieval systems and digital libraries, little research has focused on analytic models of performance. We analytically describe the performance for single and multiple processors, both when different processors have the same parameter values and when they have different values. The use of different ranking algorithms and parameter values at different sites is examined.
Robert M. Losee, Lewis Church Jr.
IEEE Trans. Parallel Distributed Syst.2