Sciweavers

2043 search results - page 145 / 409
» The Limits of Querying Ontologies
Sort
View
BDA
2007
13 years 10 months ago
Query Rewriting Based on User's Profile Knowledge
Query personalization was introduced as an advanced mechanism to allow the reformulation of database queries and adapt them to the user's domain of interest and preferences. ...
Dimitre Kostadinov, Mokrane Bouzeghoub, Sté...
IS
2007
13 years 9 months ago
Evaluation of probabilistic queries over imprecise data in constantly-evolving environments
Sensors are often employed to monitor continuously changing entities like locations of moving objects and temperature. The sensor readings are reported to a database system, and a...
Reynold Cheng, Dmitri V. Kalashnikov, Sunil Prabha...
DOLAP
2005
ACM
13 years 11 months ago
Providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP
A novel framework for providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP is presented in this paper. Such a framework allows u...
Alfredo Cuzzocrea
SIGIR
2008
ACM
13 years 7 months ago
ResIn: a combination of results caching and index pruning for high-performance web search engines
Results caching is an efficient technique for reducing the query processing load, hence it is commonly used in real search engines. This technique, however, bounds the maximum hit...
Gleb Skobeltsyn, Flavio Junqueira, Vassilis Placho...
IJCAI
2007
13 years 10 months ago
Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge-Base Combination
In the context of the Semantic Web, several approaches to the combination of ontologies, given in terms of theories of classical first-order logic, and rule bases have been propo...
Jos de Bruijn, Thomas Eiter, Axel Polleres, Hans T...