Sciweavers

1890 search results - page 371 / 378
» Querying Big Data by Accessing Small Data
Sort
View
ICDE
2009
IEEE
290views Database» more  ICDE 2009»
16 years 8 days ago
GraphSig: A Scalable Approach to Mining Significant Subgraphs in Large Graph Databases
Graphs are being increasingly used to model a wide range of scientific data. Such widespread usage of graphs has generated considerable interest in mining patterns from graph datab...
Sayan Ranu, Ambuj K. Singh
SOFSEM
2009
Springer
15 years 7 months ago
Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T1 and T2 each of which has m cells of capacity 1 such that constant access...
Martin Dietzfelbinger, Ulf Schellbach
BTW
2007
Springer
164views Database» more  BTW 2007»
15 years 4 months ago
Ruminations on Multi-Tenant Databases
: This is a position paper on multi-tenant databases. As motivation, it first describes the emerging marketplace of hosted enterprise services and the importance of using multi-ten...
Dean Jacobs, Stefan Aulbach
CCS
2007
ACM
15 years 4 months ago
Polyglot: automatic extraction of protocol message format using dynamic binary analysis
Protocol reverse engineering, the process of extracting the application-level protocol used by an implementation, without access to the protocol specification, is important for m...
Juan Caballero, Heng Yin, Zhenkai Liang, Dawn Xiao...
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
15 years 4 months ago
On adequate performance measures for paging
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...
Konstantinos Panagiotou, Alexander Souza