Sciweavers

2889 search results - page 180 / 578
» Querying Structured Hyperdocuments
Sort
View
GLOBECOM
2007
IEEE
14 years 2 months ago
A New Design of Bloom Filter for Packet Inspection Speedup
— Bloom filter is a space-efficient randomized data structure for group membership query. It is widely used in networking applications which involve the packet header/content i...
Yang Chen, Abhishek Kumar, Jun Xu
LAWEB
2005
IEEE
14 years 1 months ago
Incentive Networks
The concurrent growth of on-line communities exhibiting large-scale social structure, and of large decentralized peer-to-peer file-sharing systems, has stimulated new interest in...
Prabhakar Raghavan
DBKDA
2010
IEEE
169views Database» more  DBKDA 2010»
14 years 1 months ago
XLeaf: Twig Evaluation with Skipping Loop Joins and Virtual Nodes
Abstract—XML indexing and search has become an important topic, and twig joins are key building blocks in XML search systems. This paper describes a novel approach using a nested...
Nils Grimsmo, Truls Amundsen Bjørklund, &Os...
WEBDB
2001
Springer
113views Database» more  WEBDB 2001»
14 years 21 days ago
Indexing XML Data with ToXin
Indexing schemes for semistructured data have been developed in recent years to optimize path query processing by summarizing path information. However, most of these schemes can ...
Flavio Rizzolo, Alberto O. Mendelzon
MICS
2010
137views more  MICS 2010»
13 years 6 months ago
Finding Range Minima in the Middle: Approximations and Applications
Abstract. A Range Minimum Query asks for the position of a minimal element between two specified array-indices. We consider a natural extension of this, where our further constrai...
Johannes Fischer, Volker Heun