76 search results - page 15 / 16 » Closure-Tree: An Index Structure for Graph Queries |
WADS
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
PKDD
2004
Springer
13 years 10 months ago
2004
Springer
The next wave in search technology will be driven by the identification, extraction, and exploitation of real-world entities represented in unstructured textual sources. Search sy...
SIGMOD
2009
ACM
14 years 5 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...
CIKM
2005
Springer
13 years 10 months ago
2005
Springer
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
AMKM
2003
Springer
13 years 10 months ago
2003
Springer
This research investigates a unique Indexing Structure and Navigational Interface which integrates (1) ontology-driven knowledge-base (2) statistically derived indexing parameters...