Paper Info
Title
Operational requirements for scalable search systems
Abstract
Prior research into search system scalability has primarily addressed query processing efficiency [1, 2, 3] or indexing efficiency [3], or has presented some arbitrary system architecture [4]. Little work has introduced any formal theoretical framework for evaluating architectures with regard to specific operational requirements, or for comparing architectures beyond simple timings [5] or basic simulations [6, 7]. In this paper, we present a framework based upon queuing network theory for analyzing search systems in terms of operational requirements. We use response time, throughput, and utilization as the key operational characteristics for evaluating performance. Within this framework, we present a scalability strategy that combines index partitioning and index replication to satisfy a given set of requirement.
Year
DOI
Venue
2003
10.1145/956863.956945
CIKM
Keywords
Field
DocType
specific operational requirement,indexing efficiency,key operational characteristic,scalability strategy,operational requirement,index partitioning,formal theoretical framework,scalable search system,arbitrary system architecture,query processing efficiency,index replication,system architecture,satisfiability,indexation
Data mining,Computer science,Response time,Search engine indexing,Queuing network,Operational requirements,Systems architecture,Throughput,Scalability
Conference
ISBN
Citations 
PageRank 
1-58113-723-0
25
2.80
References 
Authors
36
2
Name
Order
Citations
PageRank
Abdur Chowdhury12013160.59
Greg Pass2101085.31