147 search results - page 20 / 30 » Size Bounds and Query Plans for Relational Joins |
ECCC
2010
13 years 6 months ago
2010
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...
ICDE
2007
IEEE
14 years 8 months ago
2007
IEEE
Recently there has been increasing interest in the development of progress indicators for SQL queries. In this paper we present a lightweight online framework for this problem. Ou...
APWEB
2010
Springer
14 years 9 days ago
2010
Springer
Abstract. The term Deep Web (sometimes also called Hidden Web) refers to the data content that is created dynamically as the result of a specific search on the Web. In this respec...
DAWAK
2005
Springer
14 years 1 months ago
2005
Springer
This paper proposes the compression of data in Relational Database Management Systems (RDBMS) using existing text compression algorithms. Although the technique proposed is general...
PODS
2005
ACM
14 years 7 months ago
2005
ACM
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...