Sciweavers

1381 search results - page 2 / 277
» Structural signatures for tree data structures
Sort
View
SOFSEM
2004
Springer
13 years 10 months ago
Tree Signatures and Unordered XML Pattern Matching
We propose an efficient approach for finding relevant XML data twigs defined by unordered query tree specifications. We use the tree signatures as the index structure and find...
Pavel Zezula, Federica Mandreoli, Riccardo Martogl...
ADBIS
2003
Springer
114views Database» more  ADBIS 2003»
13 years 10 months ago
Compressing Large Signature Trees
In this paper we present a new compression scheme for signature tree structures. Beyond the reduction of storage space, compression attains significant savings in terms of query pr...
Maria Kontaki, Yannis Manolopoulos, Alexandros Nan...
PVLDB
2010
136views more  PVLDB 2010»
13 years 3 months ago
SigMatch: Fast and Scalable Multi-Pattern Matching
Multi-pattern matching involves matching a data item against a large database of “signature” patterns. Existing algorithms for multipattern matching do not scale well as the s...
Ramakrishnan Kandhan, Nikhil Teletia, Jignesh M. P...
DATESO
2004
134views Database» more  DATESO 2004»
13 years 6 months ago
Designing Indexing Structure for Discovering Relationships in RDF Graphs
Discovering the complex relationships between entities is one way of benefitting from the Semantic Web. This paper discusses new approaches to implementing -operators into RDF quer...
Stanislav Barton
CCS
2009
ACM
13 years 11 months ago
Robust signatures for kernel data structures
Kernel-mode rootkits hide objects such as processes and threads using a technique known as Direct Kernel Object Manipulation (DKOM). Many forensic analysis tools attempt to detect...
Brendan Dolan-Gavitt, Abhinav Srivastava, Patrick ...