Sciweavers

170 search results - page 18 / 34
» Approximate Range Selection Queries in Peer-to-Peer Systems
Sort
View
DMSN
2010
ACM
13 years 6 months ago
Processing nested complex sequence pattern queries over event streams
Complex event processing (CEP) has become increasingly important for tracking and monitoring applications ranging from health care, supply chain management to surveillance. These ...
Mo Liu, Medhabi Ray, Elke A. Rundensteiner, Daniel...
VMCAI
2007
Springer
14 years 2 months ago
Better Under-Approximation of Programs by Hiding Variables
Abstraction frameworks use under-approximating transitions in order to prove existential properties of concrete systems. Under-approximating transifer to the concrete states that c...
Thomas Ball, Orna Kupferman
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
DASFAA
2004
IEEE
158views Database» more  DASFAA 2004»
14 years 6 days ago
A Cost Model for Spatial Intersection Queries on RI-Trees
Abstract. The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tr...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
14 years 1 months ago
A Cost Model for Interval Intersection Queries on RI-Trees
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...