| 
|
Quote: search is parallelizable by randomly dividing index into pieces called index shards; a pool of machines for each shard
topics >
all references >
references a-b >
Topic:
searching the Web
Topic:
full-text indexing
Topic:
data parallel processing
Quotation Skeleton
Fortunately, [Google] search is highly parallelizable by dividing … full index. A pool of machines serves requests … Google-1 Google-2
Copyright clearance needed for quotation.
Topic: searching the Web (45 items)
Topic: full-text indexing (35 items)
Topic: data parallel processing (12 items)