Sciweavers

73 search results - page 6 / 15
» An Optimal Algorithm for Querying Tree Structures and its Ap...
Sort
View
TCS
2008
15 years 3 months ago
Optimizing deletion cost for secure multicast key management
Multicast and broadcast are efficient ways to deliver messages to a group of recipients in a network. Due to the growing security concerns in various applications, messages are oft...
Zhi-Zhong Chen, Ze Feng, Minming Li, F. Frances Ya...
FOCS
2000
IEEE
15 years 7 months ago
Opportunistic Data Structures with Applications
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
Paolo Ferragina, Giovanni Manzini
127
Voted
ESA
2004
Springer
160views Algorithms» more  ESA 2004»
15 years 8 months ago
Optimal External Memory Planar Point Enclosure
Abstract. In this paper we study the external memory planar point enclosure problem: Given N axis-parallel rectangles in the plane, construct a data structure on disk (an index) su...
Lars Arge, Vasilis Samoladas, Ke Yi
150
Voted
ICICS
2007
Springer
15 years 7 months ago
Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures
Authentication is increasingly relevant to data management. Data is being outsourced to untrusted servers and clients want to securely update and query their data. For example, in ...
Charalampos Papamanthou, Roberto Tamassia
155
Voted
SIGMOD
2010
ACM
308views Database» more  SIGMOD 2010»
15 years 1 months ago
GBLENDER: towards blending visual query formulation and query processing in graph databases
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
Changjiu Jin, Sourav S. Bhowmick, Xiaokui Xiao, Ja...