Abstract—In this paper we address a novel issue for de-ductive databases with huge data repositories, namely the problem of evaluating ranked top-k queries. The problem occurs whenever we allow queries such as “find cheap hotels close to the conference location ” in which fuzzy predicates like cheap and close occur. We show how to compute efficiently the top-k answers of conjunctive queries with fuzzy predicates. I
Abstract. It is well-known that crisp RDF is not suitable to represent vague in-formation. Fuzzy RDF...
Abstract. The use of preferences in query answering, both in traditional data-bases and in ontology-...
Top-k queries have become extremely popular in the database community. Such a query, which is issued...
Abstract—In this paper we address a novel issue for de-ductive databases with huge data repositories...
Abstract. We address the problem of evaluating ranked top-k queries in descrip-tion logics. The prob...
the study of how to select k items based on fuzzy matching and ranking of database tuples (i.e. top-...
Abstract—This paper addresses the problem of evaluating ranked top-k queries with expensive predicat...
As exploratory queries become more and more popular, the study of how to select k items based on fuz...
As exploratory queries become more and more popular, the study of how to select k items based on fuz...
This paper addresses the problem of evaluating ranked top-k queries with expensive predicates. As ma...
Abstract. It is well-knwon that crisp RDF is not suitable to represent vague in-formation. Fuzzy RDF...
Introduction Ranking queries (or top-k queries) are dominant in many emerging applications, e.g., s...
The problem of obtaining efficient answers to top-k queries has attracted a lot of research attentio...
The problem of obtaining efficient answers to top-k queries has attracted a lot of research attentio...
A query to a web search engine usually consists of a list of keywords, to which the search engine re...
Abstract. It is well-known that crisp RDF is not suitable to represent vague in-formation. Fuzzy RDF...
Abstract. The use of preferences in query answering, both in traditional data-bases and in ontology-...
Top-k queries have become extremely popular in the database community. Such a query, which is issued...
Abstract—In this paper we address a novel issue for de-ductive databases with huge data repositories...
Abstract. We address the problem of evaluating ranked top-k queries in descrip-tion logics. The prob...
the study of how to select k items based on fuzzy matching and ranking of database tuples (i.e. top-...
Abstract—This paper addresses the problem of evaluating ranked top-k queries with expensive predicat...
As exploratory queries become more and more popular, the study of how to select k items based on fuz...
As exploratory queries become more and more popular, the study of how to select k items based on fuz...
This paper addresses the problem of evaluating ranked top-k queries with expensive predicates. As ma...
Abstract. It is well-knwon that crisp RDF is not suitable to represent vague in-formation. Fuzzy RDF...
Introduction Ranking queries (or top-k queries) are dominant in many emerging applications, e.g., s...
The problem of obtaining efficient answers to top-k queries has attracted a lot of research attentio...
The problem of obtaining efficient answers to top-k queries has attracted a lot of research attentio...
A query to a web search engine usually consists of a list of keywords, to which the search engine re...
Abstract. It is well-known that crisp RDF is not suitable to represent vague in-formation. Fuzzy RDF...
Abstract. The use of preferences in query answering, both in traditional data-bases and in ontology-...
Top-k queries have become extremely popular in the database community. Such a query, which is issued...
DOI
Add to ORKG