d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
We present a novel sensor network query processing architecture that (a) covers all the query optimization phases that are required to map a declarative query to executable code; ...
Ixent Galpin, Christian Y. A. Brenninkmeijer, Farh...
Abstract. Modern large distributed applications, such as telecommunication and banking services, need to respond instantly to a huge number of queries within a short period of time...
Tengjiao Wang, Bishan Yang, Allen Huang, Qi Zhang,...
We consider the coverage testing problem where we are given a document and a corpus with a limited query interface and asked to find if the corpus contains a near-duplicate of th...
Ali Dasdan, Paolo D'Alberto, Santanu Kolay, Chris ...