2514 search results - page 319 / 503 » On the Computation of Approximations of Database Queries |
188
click to vote
HPCC
2007
Springer
16 years 29 days ago
2007
Springer
In a data-indexed DHT overlay network, published data annotations form distributed databases. Queries are distributed to these databases in a nonuniform way. Constructing content d...
163
click to vote
SAC
2005
ACM
16 years 10 days ago
2005
ACM
As the usage of Web Services proliferates dramatically, new tools to help quickly generate web services are needed. In this paper, we propose a methodology that helps to automatic...
182
click to vote
ICALP
2005
Springer
16 years 9 days ago
2005
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
187
click to vote
SIGCOMM
2005
ACM
16 years 10 days ago
2005
ACM
The Internet’s core routing infrastructure, while arguably robust and efficient, has proven to be difficult to evolve to accommodate the needs of new applications. Prior researc...
181
click to vote
WWW
2009
ACM
16 years 7 months ago
2009
ACM
The question of how to publish an anonymized search log was brought to the forefront by a well-intentioned, but privacy-unaware AOL search log release. Since then a series of ad-h...