Sciweavers

559 search results - page 97 / 112
» Indexing Weighted-Sequences in Large Databases
Sort
View
COMAD
2008
13 years 9 months ago
Exploiting Asynchronous IO using the Asynchronous Iterator Model
Asynchronous IO (AIO) allows a process to continue to do other work while an IO operation initiated earlier completes. AIO allows a large number of random IO operations to be issu...
Suresh Iyengar, S. Sudarshan, Santosh Kumar 0002, ...
ICAC
2005
IEEE
14 years 1 months ago
Quickly Finding Known Software Problems via Automated Symptom Matching
We present an architecture for and prototype of a system for quickly detecting software problem recurrences. Re-discovery of the same problem is very common in many large software...
Mark Brodie, Sheng Ma, Guy M. Lohman, Laurent Mign...
SEMWEB
2004
Springer
14 years 29 days ago
Top-k Query Evaluation for Schema-Based Peer-to-Peer Networks
Abstract. Increasing the number of peers in a peer-to-peer network usually increases the number of answers to a given query as well. While having more answers is nice in principle,...
Wolfgang Nejdl, Wolf Siberski, Uwe Thaden, Wolf-Ti...
SIGMOD
2008
ACM
139views Database» more  SIGMOD 2008»
14 years 7 months ago
Paths to stardom: calibrating the potential of a peer-based data management system
As peer-to-peer (P2P) networks become more familiar to the database community, intense interest has built up in using their scalability and resilience properties to scale database...
Mihai Lupu, Beng Chin Ooi, Y. C. Tay
EDBT
2010
ACM
206views Database» more  EDBT 2010»
14 years 2 months ago
Efficient computation of trade-off skylines
When selecting alternatives from large amounts of data, trade-offs play a vital role in everyday decision making. In databases this is primarily reflected by the top-k retrieval p...
Christoph Lofi, Ulrich Güntzer, Wolf-Tilo Bal...