Sciweavers

2145 search results - page 356 / 429
» Answering Queries Using Views
Sort
View
STOC
2002
ACM
144views Algorithms» more  STOC 2002»
16 years 3 months ago
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
Surender Baswana, Ramesh Hariharan, Sandeep Sen
ESWS
2008
Springer
15 years 5 months ago
A Semantic Web Middleware for Virtual Data Integration on the Web
In this contribution a system is presented, which provides access to distributed data sources using Semantic Web technology. While it was primarily designed for data sharing and sc...
Andreas Langegger, Wolfram Wöß, Martin ...
SSDBM
2007
IEEE
127views Database» more  SSDBM 2007»
15 years 9 months ago
Update Conscious Bitmap Indices
Bitmap indices have been widely used in several domains such as data warehousing and scientific applications due to their efficiency in answering certain query types over large ...
Guadalupe Canahuate, Michael Gibas, Hakan Ferhatos...
OOPSLA
2005
Springer
15 years 8 months ago
Demand-driven points-to analysis for Java
We present a points-to analysis technique suitable for environments with small time and memory budgets, such as just-in-time (JIT) compilers and interactive development environmen...
Manu Sridharan, Denis Gopan, Lexin Shan, Rastislav...
CRYPTO
2000
Springer
157views Cryptology» more  CRYPTO 2000»
15 years 7 months ago
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing
Private information retrieval (PIR) enables a user to retrieve a data item from a database, replicated among one or more servers, while hiding the identity of the retrieved item. ...
Amos Beimel, Yuval Ishai, Tal Malkin