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...
A database application differs form regular applications in that some of its inputs may be database queries. The program will execute the queries on a database and may use any re...
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...
It is now common for video; real-time and collected, mobile and static, to be georeferenced and stored in large archives for users of expert systems to access and interact with. I...
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...