50 search results - page 6 / 10 » Enhancing Graph Database Indexing by Suffix Tree Structure |
CCS
2009
ACM
15 years 4 months ago
2009
ACM
A major challenge of the anti-virus (AV) industry is how to effectively process the huge influx of malware samples they receive every day. One possible solution to this problem i...
ICDE
2010
IEEE
15 years 4 months ago
2010
IEEE
— In this paper we propose PARINET, a new access method to efficiently retrieve the trajectories of objects moving in networks. The structure of PARINET is based on a combination...
CIKM
2009
Springer
15 years 1 months ago
2009
Springer
Current approaches to RDF graph indexing suffer from weak data locality, i.e., information regarding a piece of data appears in multiple locations, spanning multiple data structur...
150
click to vote
SIGMOD
2009
ACM
15 years 9 months ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
175
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
Estimating the selectivity of queries is a crucial problem in database systems. Virtually all database systems rely on the use of selectivity estimates to choose amongst the many ...