951 search results - page 21 / 191 » Groupwise Processing of Relational Queries |
JCSS
2008
14 years 9 months ago
2008
We give a quadratic algorithm for the following structure identification problem: given a Boolean relation R and a finite set S of Boolean relations, can the relation R be express...
151
click to vote
SIGMOD
2007
ACM
15 years 10 months ago
2007
ACM
Increasing monitoring of transactions, environmental parameters, homeland security, RFID chips and interactions of online users rapidly establishes new data sources and applicatio...
ICADL
2005
Springer
15 years 3 months ago
2005
Springer
Search engines of main-stream literature digital libraries such as ACM Digital Library, Google Scholar, and PubMed employ file-based systems, and provide users with a basic boolean...
SEKE
2007
Springer
15 years 3 months ago
2007
Springer
In this paper, we present an approach to query processing for paraconsistent databases in the presence of integrity constraints. Paraconsistent databases are capable of representi...
DATAMINE
2000
14 years 9 months ago
2000
The goal of the CONTROL project at Berkeley is to develop systems for interactive analysis of large data sets. We focus on systems that provide users with iteratively refining answ...