Sciweavers

3993 search results - page 258 / 799
» Matchmaking for Structured Objects
Sort
View
WWW
2004
ACM
16 years 4 months ago
RDFPeers: a scalable distributed RDF repository based on a structured peer-to-peer network
Centralized Resource Description Framework (RDF) repositories have limitations both in their failure tolerance and in their scalability. Existing Peer-to-Peer (P2P) RDF repositori...
Min Cai, Martin R. Frank
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
16 years 4 months ago
Bit-probe lower bounds for succinct data structures
We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...
Emanuele Viola
EWSN
2004
Springer
16 years 3 months ago
Structured Communication in Single Hop Sensor Networks
Abstract. We propose a model for communication in single-hop wireless sensor networks and define and evaluate the performance of a robust, energy balanced protocol for a powerful a...
Amol Bakshi, Viktor K. Prasanna
SSD
2005
Springer
185views Database» more  SSD 2005»
15 years 9 months ago
Evaluation of a Dynamic Tree Structure for Indexing Query Regions on Streaming Geospatial Data
Most recent research on querying and managing data streams has concentrated on traditional data models where the data come in the form of tuples or XML data. Complex types of strea...
Quinn Hart, Michael Gertz, Jie Zhang
ICDT
1995
ACM
96views Database» more  ICDT 1995»
15 years 7 months ago
On Two Forms of Structural Recursion
We investigate and compare two forms of recursion on sets for querying nested collections. The rst one is called sri and it corresponds to sequential processing of data. The second...
Dan Suciu, Limsoon Wong