Exact substring matching queries on large data collections can be answered using q-gram indices, that store for each occurring q-byte pattern an (ordered) posting list with the po...
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all rectangles in S intersecting a query rectangle or point ca...
Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that "match" certain query gr...
Today’s one-pass analytics applications tend to be data-intensive in nature and require the ability to process high volumes of data efficiently. MapReduce is a popular programm...
Boduo Li, Edward Mazur, Yanlei Diao, Andrew McGreg...
—We propose a novel scenario called “writer retrieval” consisting in the retrieval from a set of documents all those produced by the same writer. The retrieval is based on a ...