208 search results - page 2 / 42 » Efficient Computation of Multiple Group By Queries |
ADBIS
1998
Springer
13 years 9 months ago
1998
Springer
In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for process...
ICCS
2007
Springer
13 years 11 months ago
2007
Springer
SIGMOD
2009
ACM
14 years 5 months ago
2009
ACM
Existing keyword-search systems in relational databases require users to submit a complete query to compute answers. Often users feel "left in the dark" when they have l...
ICDE
2008
IEEE
14 years 6 months ago
2008
IEEE
Abstract-- Cisco's NetFlow Collector (NFC) is a powerful example of a real-world product that supports multiple aggregate queries over a continuous stream of IP flow records. ...
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
We give a polynomial time algorithm that computes a decomposition of a finite group G given in the form of its multiplication table. That is, given G, the algorithm outputs two su...