Sciweavers

208 search results - page 4 / 42
» Efficient Computation of Multiple Group By Queries
Sort
View
TSP
2008
122views more  TSP 2008»
13 years 7 months ago
Quality of Service and Max-Min Fair Transmit Beamforming to Multiple Cochannel Multicast Groups
The problem of transmit beamforming to multiple cochannel multicast groups is considered, when the channel state is known at the transmitter and from two viewpoints: minimizing tot...
Eleftherios Karipidis, Nikos D. Sidiropoulos, Zhi-...
SERVICES
2008
103views more  SERVICES 2008»
13 years 9 months ago
Grouping Distributed Stream Query Services by Operator Similarity and Network Locality
Distributed stream query services must simultaneously process a large number of complex, continuous queries with stringent performance requirements while utilizing distributed pro...
Sangeetha Seshadri, Bhuvan Bamba, Brian F. Cooper,...
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
13 years 5 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...
PVLDB
2010
179views more  PVLDB 2010»
13 years 6 months ago
MRShare: Sharing Across Multiple Queries in MapReduce
Large-scale data analysis lies in the core of modern enterprises and scientific research. With the emergence of cloud computing, the use of an analytical query processing infrast...
Tomasz Nykiel, Michalis Potamias, Chaitanya Mishra...
EDBT
2009
ACM
145views Database» more  EDBT 2009»
13 years 11 months ago
Efficient top-k count queries over imprecise duplicates
We propose efficient techniques for processing various TopK count queries on data with noisy duplicates. Our method differs from existing work on duplicate elimination in two sign...
Sunita Sarawagi, Vinay S. Deshpande, Sourabh Kasli...