83 search results - page 9 / 17 » Factorizing Complex Predicates in Queries to Exploit Indexes |
WWW
2008
ACM
14 years 8 months ago
2008
ACM
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
FLAIRS
2007
13 years 10 months ago
2007
The basic aim of the model proposed here is to automatically build semantic metatext structure for texts that would allow us to search and extract discourse and semantic informati...
SSDBM
2010
IEEE
13 years 5 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
DAWAK
1999
Springer
14 years 1 hour ago
1999
Springer
Efficient index construction in multidimensional data spaces is important for many knowledge discovery algorithms, because construction times typically must be amortized by perform...
CIKM
2011
Springer
12 years 7 months ago
2011
Springer
Many large-scale Web applications that require ranked top-k retrieval are implemented using inverted indices. An inverted index represents a sparse term-document matrix, where non...