Sciweavers

2983 search results - page 428 / 597
» The group marriage problem
Sort
View
OSDI
2002
ACM
14 years 9 months ago
Secure Routing for Structured Peer-to-Peer Overlay Networks
Structured peer-to-peer overlay networks provide a substrate for the construction of large-scale, decentralized applications, including distributed storage, group communication, a...
Miguel Castro, Peter Druschel, Ayalvadi J. Ganesh,...
VLDB
2007
ACM
114views Database» more  VLDB 2007»
14 years 9 months ago
Optimization and evaluation of shortest path queries
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
Edward P. F. Chan, Heechul Lim
SIGMOD
2009
ACM
189views Database» more  SIGMOD 2009»
14 years 9 months ago
Query segmentation using conditional random fields
A growing mount of available text data are being stored in relational databases, giving rise to an increasing need for the RDBMSs to support effective text retrieval. In this pape...
Xiaohui Yu, Huxia Shi
SIGMOD
2002
ACM
91views Database» more  SIGMOD 2002»
14 years 9 months ago
A scalable hash ripple join algorithm
Recently, Haas and Hellerstein proposed the hash ripple join algorithm in the context of online aggregation. Although the algorithm rapidly gives a good estimate for many join-agg...
Gang Luo, Curt J. Ellmann, Peter J. Haas, Jeffrey ...
EDBT
2004
ACM
147views Database» more  EDBT 2004»
14 years 9 months ago
Efficient Query Evaluation over Compressed XML Data
XML suffers from the major limitation of high redundancy. Even if compression can be beneficial for XML data, however, once compressed, the data can be seldom browsed and queried i...
Andrei Arion, Angela Bonifati, Gianni Costa, Sandr...