Sciweavers

18697 search results - page 3632 / 3740
» Systemic Security Management
Sort
View
CIKM
2010
Springer
15 years 3 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
FGCS
2010
84views more  FGCS 2010»
15 years 3 months ago
System-level virtualization research at Oak Ridge National Laboratory
System-level virtualization is today enjoying a rebirth, after first gaining popularity in the 1970s as a technique to effectively share what were then considered large computin...
Stephen L. Scott, Geoffroy Vallée, Thomas N...
178
Voted
JIDM
2010
160views more  JIDM 2010»
15 years 3 months ago
Evaluation of Conditional Preference Queries
The need for incorporating preference querying in database technology is a very important issue in a variety of applications ranging from e-commerce to personalized search engines....
Fabiola S. F. Pereira, Sandra de Amo
REPLICATION
2010
15 years 2 months ago
A History of the Virtual Synchrony Replication Model
In this chapter, we discuss a widely used fault-tolerant data replication model called virtual synchrony. The model responds to two kinds of needs. First, there is the practical qu...
Ken Birman
SIGMOD
2010
ACM
145views Database» more  SIGMOD 2010»
15 years 2 months ago
How to ConQueR why-not questions
One useful feature that is missing from today’s database systems is an explain capability that enables users to seek clarifications on unexpected query results. There are two t...
Quoc Trung Tran, Chee-Yong Chan
« Prev « First page 3632 / 3740 Last » Next »