1042 search results - page 182 / 209 » Constraint Databases, Data Structures and Efficient Query Ev... |
WABI
2009
Springer
14 years 2 months ago
2009
Springer
Background: The fingerprint of a molecule is a bitstring based on its structure, constructed such that structurally similar molecules will have similar fingerprints. Molecular fin...
PKDD
2010
Springer
13 years 5 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
To address the needs of data intensive XML applications, a number of efficient tree pattern algorithms have been proposed. Still, most XQuery compilers do not support those algori...
XSYM
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We are presenting a coherent framework for XQuery processing that incorporates IR-style approximate matching and allows the ordering of results by their relevance score. ...
ESWS
2008
Springer
13 years 9 months ago
2008
Springer
A fundamental problem related to graph structured databases is searching for substructures. One issue with respect to optimizing such searches is the ability to estimate the freque...