Sciweavers

14 search results - page 2 / 3
» Efficient temporal counting with bounded error
Sort
View
ICDE
2008
IEEE
161views Database» more  ICDE 2008»
14 years 6 months ago
Convoy Queries in Spatio-Temporal Databases
We introduce a convoy query that retrieves all convoys from historical trajectories, each of which consists of a set of objects that travelled closely during a certain time period....
Hoyoung Jeung, Heng Tao Shen, Xiaofang Zhou
EDBT
2008
ACM
137views Database» more  EDBT 2008»
14 years 5 months ago
Optimizing away joins on data streams
Abstract. Monitoring aggregates on IP traffic data streams is a compelling application for data stream management systems. Often, such streaming aggregation queries involve joining...
Lukasz Golab, Theodore Johnson, Nick Koudas, Dives...
CCR
2002
105views more  CCR 2002»
13 years 5 months ago
Adaptive packet sampling for flow volume measurement
Traffic measurement and monitoring are an important component of network management and traffic engineering. With high-speed Internet backbone links, efficient and effective packe...
Baek-Young Choi, Jaesung Park, Zhi-Li Zhang
ICALP
2009
Springer
14 years 5 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
ICDE
2007
IEEE
111views Database» more  ICDE 2007»
14 years 6 months ago
Proof Sketches: Verifiable In-Network Aggregation
Recent work on distributed, in-network aggregation assumes a benign population of participants. Unfortunately, modern distributed systems are plagued by malicious participants. In...
Minos N. Garofalakis, Joseph M. Hellerstein, Petro...