1402 search results - page 69 / 281 » Sparse-Memory Graph Search |
194
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs. These methods, however, are rather expensive as th...
192
click to vote
ICDE
2002
IEEE
15 years 11 months ago
2002
IEEE
With the growth of the Web, there has been a rapid increase in the number of users who need to access online databases without having a detailed knowledge of the schema or of quer...
WWW
2003
ACM
15 years 10 months ago
2003
ACM
Recent web search techniques augment traditional text matching with a global notion of "importance" based on the linkage structure of the web, such as in Google's P...
SIGCSE
2002
ACM
14 years 9 months ago
2002
ACM
We present our experience using a large, real-world application as a course project for the second half of the semester of a CS2 course. Our primary goal for the project was to cr...
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries si...