Sciweavers

1890 search results - page 169 / 378
» Querying Big Data by Accessing Small Data
Sort
View
GLOBECOM
2007
IEEE
16 years 26 days 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
DBKDA
2010
IEEE
169views Database» more  DBKDA 2010»
15 years 11 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...
MOBICOM
2000
ACM
15 years 11 months ago
A scalable low-latency cache invalidation strategy for mobile environments
—Caching frequently accessed data items on the client side is an effective technique for improving performance in a mobile environment. Classical cache invalidation strategies ar...
Guohong Cao
CIKM
2011
Springer
14 years 6 months ago
Keyword search over RDF graphs
Large knowledge bases consisting of entities and relationships between them have become vital sources of information for many applications. Most of these knowledge bases adopt the...
Shady Elbassuoni, Roi Blanco
WWW
2007
ACM
16 years 7 months ago
Towards multi-granularity multi-facet e-book retrieval
Generally speaking, digital libraries have multiple granularities of semantic units: book, chapter, page, paragraph and word. However, there are two limitations of current eBook r...
Chong Huang, YongHong Tian, Zhi Zhou, Tiejun Huang