99 search results - page 7 / 20 » On the complexity of division and set joins in the relationa... |
ISMIS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Paraconsistent intuitionistic fuzzy set is an extension of intuitionistic fuzzy set or interval-valued fuzzy set. It relaxes the requirement that t + f ≤ 1, where t is ...
TCS
2002
13 years 7 months ago
2002
In this work, we investigate various specification languages and their relation to Casl, the recently developed Common Algebraic Specification Language. In particular, we consider...
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the...
EDBT
2010
ACM
13 years 10 months ago
2010
ACM
Keyword-based search in relational databases allows users to discover relevant information without knowing the database schema or using complicated queries. However, such searches...
ICDE
1998
IEEE
14 years 9 months ago
1998
IEEE
Algebraic transformation and optimization techniques have been the method of choice in relational query execution, but applying them in OODBMS is difficult due to the complexity o...