Researchers are currently more interested in searching for fragments that are similar to a query, than a total data item that is similar to a query; the search interest is for &qu...
Punpiti Piamsa-nga, Nikitas A. Alexandridis, Sanan...
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
With the wide development of databases in general and data warehouses in particular, it is important to reduce the tasks that a database administrator must perform manually. The a...
We describe data structures for representing simplicial meshes compactly while supporting online queries and updates efficiently. Our data structure requires about a factor of fi...
Daniel K. Blandford, Guy E. Blelloch, David E. Car...
Column-stores gained popularity as a promising physical design alternative. Each attribute of a relation is physically stored as a separate column allowing queries to load only th...
Stratos Idreos, Martin L. Kersten, Stefan Manegold