2889 search results - page 270 / 578 » Querying Structured Hyperdocuments |
279
click to vote
SIGMOD
2009
ACM
16 years 5 months ago
2009
ACM
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...
142
click to vote
WWW
2007
ACM
16 years 5 months ago
2007
ACM
We describe a query-driven indexing framework for scalable text retrieval over structured P2P networks. To cope with the bandwidth consumption problem that has been identified as ...
152
click to vote
SWAT
2000
Springer
15 years 8 months ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
173
click to vote
CCS
2008
ACM
15 years 7 months ago
2008
ACM
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
141
click to vote
CGI
1998
IEEE
15 years 9 months ago
1998
IEEE
Ray tracing and Monte-Carlo based global illumination, as well as radiosity and other finite-element based global illumination methods, all require repeated evaluation of quantita...