297 search results - page 43 / 60 » On the Decidability of Consistent Query Answering |
101
click to vote
ICDE
2008
IEEE
15 years 8 months ago
2008
IEEE
The Web has the potential to become the world’s
largest knowledge base. In order to unleash this potential,
the wealth of information available on the Web needs to be
extracte...
WWW
2006
ACM
14 years 9 months ago
2006
ACM
We address the problem of answering broad-topic queries on the World Wide Web. We present a link based analysis algorithm SelHITS, which is an improvement over Kleinberg's HI...
FSTTCS
2004
Springer
14 years 1 months ago
2004
Springer
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...
EMNLP
2009
13 years 6 months ago
2009
There have been increasing needs for task specific rankings in web search such as rankings for specific query segments like long queries, time-sensitive queries, navigational quer...
SIGMOD
2004
ACM
14 years 8 months ago
2004
ACM
As more and more query processing work can be done in main memory, memory access is becoming a significant cost component of database operations. Recent database research has show...