Indexes are special purpose data structures, designed to facilitate and speed up the access
to the contents of a file. Indexing has been actively and extensively investigated in DBMSes …

In this paper we develop optimal algorithms in the binary-forking model for a variety of
fundamental problems, including sorting, semisorting, list ranking, tree contraction, range …

Non-volatile main memory (NVRAM) technologies provide an attractive set of features for
large-scale graph analytics, including byte-addressability, low idle power, and improved …

We consider a parallel computational model, the Parallel Persistent Memory model,
comprised of P processors, each with a fast local ephemeral memory of limited size, and …

In this paper, we design parallel write-efficient geometric algorithms that perform
asymptotically fewer writes than standard algorithms for the same problem. This is motivated …

The support of range, segment and rectangle queries are fundamental problems in
computational geometry, and have extensive applications in many domains. Despite …

The future of main memory appears to lie in the direction of new technologies that provide
strong capacity-to-performance ratios, but have write operations that are much more …

Storage devices have complex performance profiles, including costs to initiate IOs (eg, seek
times in hard drives), parallelism and bank conflicts (in SSDs), costs to transfer data, and …

The literature on cache replacement, while both detailed and extensive, neglects to account
for the flow of data to storage. Motivated by emerging memory technologies and the …

The future of main memory appears to lie in the direction of new non-volatile memory
technologies that provide strong capacity-to-performance ratios, but have write operations …