Sciweavers

65 search results - page 13 / 13
» Efficient Memory Bound Puzzles Using Pattern Databases
Sort
View
PODS
2007
ACM
109views Database» more  PODS 2007»
14 years 5 months ago
What is "next" in event processing?
Event processing systems have wide applications ranging from managing events from RFID readers to monitoring RSS feeds. Consequently, there exists much work on them in the literat...
Walker M. White, Mirek Riedewald, Johannes Gehrke,...
SIGMOD
2009
ACM
171views Database» more  SIGMOD 2009»
14 years 5 months ago
GAMPS: compressing multi sensor data by grouping and amplitude scaling
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
Sorabh Gandhi, Suman Nath, Subhash Suri, Jie Liu
PDCN
2004
13 years 6 months ago
Speculative prefetching of optional locks in distributed systems
We present a family of methods for speeding up distributed locks by exploiting the uneven distribution of both temporal and spatial locality of access behaviour of many applicatio...
Thomas Schöbel-Theuer
WWW
2008
ACM
14 years 5 months ago
Scaling RDF with time
The World Wide Web Consortium's RDF standard primarily consists of (subject,property,object) triples that specify the value that a given subject has for a given property. How...
Andrea Pugliese, Octavian Udrea, V. S. Subrahmania...
DEXA
2007
Springer
154views Database» more  DEXA 2007»
13 years 11 months ago
Beyond Lazy XML Parsing
XML has become the standard format for data representation and exchange in domains ranging from Web to desktop applications. However, wide adoption of XML is hindered by inefficien...
Fernando Farfán, Vagelis Hristidis, Raju Ra...