2043 search results - page 258 / 409 » The Limits of Querying Ontologies |
IJCAI
1997
13 years 10 months ago
1997
Generating query-answering plans for information gathering agents requires to translate a user query, formulated in terms of a set of virtual relations, to a query that uses relat...
DKE
2002
13 years 9 months ago
2002
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
INFOCOM
2012
IEEE
11 years 11 months ago
2012
IEEE
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
SDM
2012
SIAM
11 years 11 months ago
2012
SIAM
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
WWW
2009
ACM
14 years 10 months ago
2009
ACM
The majority of people in rural developing regions do not have access to the World Wide Web. Traditional network connectivity technologies have proven to be prohibitively expensiv...