메뉴 건너뛰기




Volumn , Issue , 2008, Pages 289-300

On static determination of temporal relevance for incremental evaluation of complex event queries

Author keywords

Complex Event Processing, Event Queries, Temporal Relevance, Garbage Collection, CERA, Events, Rules

Indexed keywords

COMPILE-TIME; COMPLEX EVENT PROCESSING, EVENT QUERIES, TEMPORAL RELEVANCE, GARBAGE COLLECTION, CERA, EVENTS, RULES; GARBAGE COLLECTIONS; INCREMENTAL EVALUATIONS; INTERMEDIATE RESULTS; QUERY EVALUATIONS; RUN-TIME; TEMPORAL RELEVANCES; TIME PROGRESS;

EID: 57549114492     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1385989.1386025     Document Type: Conference Paper
Times cited : (5)

References (22)
  • 1
    • 33746364223 scopus 로고    scopus 로고
    • SnoopIB: Interval-based event specification and detection for active databases
    • R. Adaikkalavan and S. Chakravarthy. SnoopIB: Interval-based event specification and detection for active databases. Data and Knowledge Eng., 59(1), 2006.
    • (2006) Data and Knowledge Eng , vol.59 , Issue.1
    • Adaikkalavan, R.1    Chakravarthy, S.2
  • 3
    • 0020849266 scopus 로고
    • Maintaining Knowledge About Temporal Intervals
    • J. F. Allen. Maintaining Knowledge About Temporal Intervals. Communications of the ACM, 26(11), 1983.
    • (1983) Communications of the ACM , vol.26 , Issue.11
    • Allen, J.F.1
  • 4
    • 33745289988 scopus 로고    scopus 로고
    • The CQL continuous query language: Semantic foundations and query execution
    • A. Arasu, S. Babu, and J. Widom. The CQL continuous query language: Semantic foundations and query execution. VLDB Journal, 15(2): 121-142, 2006.
    • (2006) VLDB Journal , vol.15 , Issue.2 , pp. 121-142
    • Arasu, A.1    Babu, S.2    Widom, J.3
  • 5
    • 7544219531 scopus 로고    scopus 로고
    • Exploiting k-constraints to reduce memory overhead in continuous queries over data streams
    • S. Babu, U. Srivastava, and J. Widom. Exploiting k-constraints to reduce memory overhead in continuous queries over data streams. ACM Trans. Database Syst, 29(3):545-580, 2004.
    • (2004) ACM Trans. Database Syst , vol.29 , Issue.3 , pp. 545-580
    • Babu, S.1    Srivastava, U.2    Widom, J.3
  • 14
    • 0020177941 scopus 로고
    • A fast algorithm for the many pattern/many object pattern match problem
    • C. L. Forgy. A fast algorithm for the many pattern/many object pattern match problem. Artif. Intelligence, 19(1), 1982.
    • (1982) Artif. Intelligence , vol.19 , Issue.1
    • Forgy, C.L.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.