158
Voted
CIKM
2009
Springer
15 years 9 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...
144
click to vote
CIKM
2009
Springer
15 years 9 months ago
2009
Springer
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
119
Voted
DAC
2007
ACM
15 years 9 months ago
2007
ACM
153
Voted
CIKM
2009
Springer
15 years 9 months ago
2009
Springer
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
145
click to vote
DAC
2007
ACM
15 years 9 months ago
2007
ACM
Using FPGAs, a designer can separate the design process from the manufacturing flow. Therefore, the owner of a sensitive design need not expose the design to possible theft and ta...