768 search results - page 11 / 154 » Efficient Correlation Search from Graph Databases |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The premise of automated alert correlation is to accept that false alerts from a low level intrusion detection system are inevitable and use attack models to explain the output in ...
181
click to vote
ICDE
2003
IEEE
15 years 10 months ago
2003
IEEE
XKeyword provides efficient keyword proximity queries on large XML graph databases. A query is simply a list of keywords and does not require any schema or query language knowledg...
ICDE
2010
IEEE
2010
IEEE
Techniques for Efficiently Searching in Spatial, Temporal, Spatio-temporal, and Multimedia Databases
15 years 9 months ago
This tutorial provides a comprehensive and comparative overview of general techniques to efficiently support similarity queries in spatial, temporal, spatio-temporal, and multimedi...
RSCTC
2000
Springer
15 years 1 months ago
2000
Springer
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
ICDE
2010
IEEE
15 years 9 months ago
2010
IEEE
A supergraph containment search is to retrieve the data graphs contained by a query graph. In this paper, we study the problem of efficiently retrieving all data graphs approximate...