50 search results - page 8 / 10 » Enhancing Graph Database Indexing by Suffix Tree Structure |
206
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
With the advance of the Semantic Web, varying RDF data were increasingly generated, published, queried, and reused via the Web. For example, the DBpedia, a community effort to extr...
106
click to vote
PPOPP
2010
ACM
15 years 6 months ago
2010
ACM
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
ADBIS
2003
Springer
15 years 2 months ago
2003
Springer
Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value” of this n-tuple is the value of a linear function of distances of the n objects...
WWW
2008
ACM
15 years 10 months ago
2008
ACM
The World Wide Web Consortium's RDF standard primarily consists of (subject,property,object) triples that specify the value that a given subject has for a given property. How...
175
click to vote
SIGMOD
2009
ACM
15 years 9 months ago
2009
ACM
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the...