Sciweavers

409 search results - page 76 / 82
» Combining Efficient XML Compression with Query Processing
Sort
View
ICDE
2003
IEEE
114views Database» more  ICDE 2003»
14 years 8 months ago
Ranked Join Indices
A plethora of data sources contain data entities that could be ordered according to a variety of attributes associated with the entities. Such orderings result effectively in a ra...
Panayiotis Tsaparas, Themistoklis Palpanas, Yannis...
IPPS
2008
IEEE
14 years 1 months ago
Reducing wasted resources to help achieve green data centers
In this paper we introduce a new approach to the consolidation strategy of a data center that allows an important reduction in the amount of active nodes required to process a het...
Jordi Torres, David Carrera, Kevin Hogan, Ricard G...
PODS
2003
ACM
158views Database» more  PODS 2003»
14 years 7 months ago
Computing full disjunctions
Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...
Yaron Kanza, Yehoshua Sagiv
SIGMOD
2004
ACM
166views Database» more  SIGMOD 2004»
14 years 7 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,...
ISCIS
2005
Springer
14 years 26 days ago
Admission Control for Multicast Routing with Quality of Service in Ad Hoc Networks
Ad hoc networks, being able to organize themselves without user intervention, can easily provide their users with mobility, multimedia support and group communication. However, the...
Kaan Bür, Cem Ersoy