53 search results - page 9 / 11 » Efficient Trie-Based Sorting of Large Sets of Strings |
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
Database archiving is important for the retrieval of old versions of a database and for temporal queries over the history of data. We demonstrate XArch, a management system for ma...
SCN
2008
Springer
13 years 7 months ago
2008
Springer
Consider an electronic election scheme implemented using a mix-net; a large number of voters submit their votes and then a smaller number of servers compute the result. The mix-net...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
Online feature selection (OFS) provides an efficient way to sort through a large space of features, particularly in a scenario where the feature space is large and features take a...
SIGMOD
1997
ACM
13 years 11 months ago
1997
ACM
The Partitioned Based Spatial-Merge Join (PBSM) of Patel and DeWitt and the Size Separation Spatial Join (S3 J) of Koudas and Sevcik are considered to be among the most efficient ...
SIGCOMM
2006
ACM
14 years 1 months ago
2006
ACM
There is a growing demand for network devices capable of examining the content of data packets in order to improve network security and provide application-specific services. Most...