Abstract. We propose measures for compressed data structures, in which space usage is measured in a data-aware manner. In particular, we consider the fundamental dictionary problem...
There has been little attention to search based test data generation in the presence of pointer inputs and dynamic data structures, an area in which recent concolic methods have e...
Structured embedded databases are currently becoming an integrated part of embedded systems, thus, enabling higher standards in system automation. These embedded databases are typ...
Jayaprakash Pisharath, Alok N. Choudhary, Mahmut T...
This paper considers a multi-query optimization issue for distributed similarity query processing, which attempts to exploit the dependencies in the derivation of a query evaluati...
A data structure, called a biased range tree, is presented that preprocesses a set S of n points in R2 and a query distribution D for 2-sided orthogonal range counting queries. The...