Sciweavers

251 search results - page 35 / 51
» Processing Multiple Aggregation Queries in Geo-Sensor Networ...
Sort
View
ISCAPDCS
2003
13 years 9 months ago
A Super-Peer Based Lookup in Structured Peer-to-Peer Systems
All existing lookup algorithms in structured peerto-peer (P2P) systems assume that all peers are uniform in resources (e.g., network bandwidth, storage and CPU). Messages are rout...
Yingwu Zhu, Honghao Wang, Yiming Hu
SIGMOD
2004
ACM
166views Database» more  SIGMOD 2004»
14 years 8 months ago
Fast Computation of Database Operations using Graphics Processors
We present new algorithms on commodity graphics processors to perform fast computation of several common database operations. Specifically, we consider operations such as conjunct...
Naga K. Govindaraju, Brandon Lloyd, Wei Wang 0010,...
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
14 years 26 days ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer
SIGMOD
2009
ACM
180views Database» more  SIGMOD 2009»
14 years 8 months ago
Indexing correlated probabilistic databases
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...
Bhargav Kanagal, Amol Deshpande
CDB
2004
Springer
143views Database» more  CDB 2004»
14 years 1 months ago
Constraint Processing Techniques for Improving Join Computation: A Proof of Concept
Constraint Processing and Database techniques overlap significantly. We discuss here the application of a constraint satisfaction technique, called dynamic bundling, to databases....
Anagh Lal, Berthe Y. Choueiry