415 search results - page 5 / 83 » Efficient Processing of Relational Queries with Sum Constrai... |
ICDE
1995
IEEE
14 years 8 months ago
1995
IEEE
?In a fuzzy relational database where a relation is a fuzzy set of tuples and ill-known data are represented by possibility distributions, nested fuzzy queries can be expressed in ...
PODS
1999
ACM
13 years 11 months ago
1999
ACM
We investigate the problem of how to extend constraint query languages with aggregate operators. We deal with standard relational aggregation, and also with aggregates speci c to ...
SEKE
2007
Springer
14 years 1 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...
WEBDB
2010
Springer
13 years 5 months ago
2010
Springer
The Semantic Web, which represents a web of knowledge, offers new opportunities to search for knowledge and information. To harvest such search power requires robust and scalable ...
IJSWIS
2008
13 years 7 months ago
2008
Relational technology has shown to be very useful for scalable Semantic Web data management. Numerous researchers have proposed to use RDBMSs to store and query voluminous RDF dat...