3405 search results - page 258 / 681 » Factoring Groups Efficiently |
276
click to vote
SIGMOD
2006
ACM
16 years 6 months ago
2006
ACM
This paper presents a principled framework for efficient processing of ad-hoc top-k (ranking) aggregate queries, which provide the k groups with the highest aggregates as results....
205
click to vote
APWEB
2004
Springer
16 years 2 days ago
2004
Springer
Abstract With the growing importance of XML in data exchange, much research tends to provide a compact labeling scheme and a flexible query facility to extract data from dynamic XM...
178
click to vote
SSDBM
2003
IEEE
15 years 12 months ago
2003
IEEE
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existin...
233
click to vote
DASFAA
2004
IEEE
15 years 10 months ago
2004
IEEE
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...
157
click to vote
IADIS
2008
15 years 8 months ago
2008
This article presents an online cluster using genetic algorithms to increase information retrieval efficiency. The Information Retrieval (IR) is based on the grouping of documents...