3405 search results - page 183 / 681 » Factoring Groups Efficiently |
156
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
Counting networks were introduced as a new class of concurrent, distributed, low contention data structures suitable for implementing shared counters. Their structure is similar t...
229
click to vote
STOC
1998
ACM
15 years 10 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
174
click to vote
SIGMOD
1996
ACM
15 years 10 months ago
1996
ACM
Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data ...
187
click to vote
PDIS
1994
IEEE
15 years 10 months ago
1994
IEEE
Many parallel join algorithms have been proposed so far but most of which are developed focused on minimizing the disk It0 and CPU costs. The communication cost, however, is also ...
183
click to vote
DASFAA
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract. In this paper, we present a novel ordered XPATH evaluation in treeunaware RDBMS. The novelties of our approach lies in the followings. (a) We propose a novel XML storage ...