Sciweavers

707 search results - page 50 / 142
» Processing queries on tree-structured data efficiently
Sort
View
SOSP
2001
ACM
14 years 5 months ago
Building Efficient Wireless Sensor Networks with Low-Level Naming
In most distributed systems, naming of nodes for low-level communication leveragestopologicallocation(such as node addresses) and is independentof any application. In this paper, ...
John S. Heidemann, Fabio Silva, Chalermek Intanago...
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
13 years 8 months ago
Near-optimal algorithms for shared filter evaluation in data stream systems
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
ICDE
2005
IEEE
180views Database» more  ICDE 2005»
14 years 10 months ago
A Unified Framework for Monitoring Data Streams in Real Time
Online monitoring of data streams poses a challenge in many data-centric applications, such as telecommunications networks, traffic management, trend-related analysis, webclick st...
Ahmet Bulut, Ambuj K. Singh
ICDE
2002
IEEE
181views Database» more  ICDE 2002»
14 years 1 months ago
YFilter: Efficient and Scalable Filtering of XML Documents
Soon, much of the data exchanged over the Internet will be encoded in XML, allowing for sophisticated filtering and content-based routing. We have built a filtering engine called ...
Yanlei Diao, Peter M. Fischer, Michael J. Franklin...
SIGMOD
2008
ACM
188views Database» more  SIGMOD 2008»
14 years 8 months ago
Just-in-time query retrieval over partially indexed data on structured P2P overlays
Structured peer-to-peer (P2P) overlays have been successfully employed in many applications to locate content. However, they have been less effective in handling massive amounts o...
Sai Wu, Jianzhong Li, Beng Chin Ooi, Kian-Lee Tan