Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Dynamic Memory Allocation Policies for Postings in Real-Time Twitter
  Search   We explore a real-time Twitter search application where tweets are arriving
at a rate of several thousands per second. Real-time search demands that they
be indexed and searchable immediately, which leads to a number of
implementation challenges. In this paper, we focus on one aspect: dynamic
postings allocation policies for index structures that are completely held in
main memory. The core issue can be characterized as a "Goldilocks Problem".
Because memory remains today a scare resource, an allocation policy that is too
aggressive leads to inefficient utilization, while a policy that is too
conservative is slow and leads to fragmented postings lists. We present a
dynamic postings allocation policy that allocates memory in increasingly-larger
"slices" from a small number of large, fixed pools of memory. Through
analytical models and experiments, we explore different settings that balance
time (query evaluation speed) and space (memory utilization).

14
The categories of this paper are: math-ph
10
The categories of this paper are: q-bio
23
The categories of this paper are: solv-int
26
The categories of this paper are: bayes-an
25
The categories of this paper are: patt-sol
4
The categories of this paper are: cond-mat
36
The categories of this paper are: cmp-lg
17
The categories of this paper are: q-fin
34
The categories of this paper are: chem-ph
37
The categories of this paper are: supr-con
31
The categories of this paper are: ao-sci
21
The categories of this paper are: adap-org
29
The categories of this paper are: funct-an
7
The categories of this paper are: hep-th
22
The categories of this paper are: chao-dyn
18
The categories of this paper are: econ