2229 search results - page 35 / 446 » The Case for Grounding Databases |
GIS
2010
ACM
13 years 6 months ago
2010
ACM
The problem of point-to-point shortest path computation in spatial networks is extensively studied with many approaches proposed to speed-up the computation. Most of the existing ...
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
ICDE
2007
IEEE
14 years 8 months ago
2007
IEEE
Recent work has shown the necessity of considering an attacker's background knowledge when reasoning about privacy in data publishing. However, in practice, the data publishe...
ADC
2003
Springer
14 years 20 days ago
2003
Springer
To run a smart E-Business or provide efficient Web service, a web services composition model is needed. Web services composition refers to the process of collaborating the heterog...
SIGMOD
2004
ACM
14 years 7 months ago
2004
ACM
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...