Sciweavers

3122 search results - page 391 / 625
» Storing Semistructured Data with STORED
Sort
View
SIGMOD
2006
ACM
161views Database» more  SIGMOD 2006»
16 years 6 months ago
Paper-based mobile access to databases
Our demonstration is a paper-based interactive guide for visitors to the world's largest international arts festival that was developed as part of a project investigating new...
Beat Signer, Moira C. Norrie, Michael Grossniklaus...
PODS
2005
ACM
131views Database» more  PODS 2005»
16 years 6 months ago
Space efficient mining of multigraph streams
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...
Graham Cormode, S. Muthukrishnan
ICCD
2005
IEEE
101views Hardware» more  ICCD 2005»
16 years 3 months ago
Restrictive Compression Techniques to Increase Level 1 Cache Capacity
Increasing cache latencies limit L1 cache sizes. In this paper we investigate restrictive compression techniques for level 1 data cache, to avoid an increase in the cache access l...
Prateek Pujara, Aneesh Aggarwal
PADL
2010
Springer
16 years 3 months ago
An ER-Based Framework for Declarative Web Programming
This paper describes a framework to support the implementation of web-based systems to manipulate data stored in relational databases. Since the conceptual model of a relational da...
Michael Hanus, Sven Koschnicke
AINA
2009
IEEE
16 years 1 months ago
A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
Yeim-Kuan Chang, Yung-Chieh Lin