2859 search results - page 59 / 572 » Querying Complex Structured Databases |
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
Abstract-- Current twig join algorithms incur high memory costs on queries that involve child-axis nodes. In this paper we provide an analytical explanation for this phenomenon. In...
CSB
2003
IEEE
14 years 1 months ago
2003
IEEE
We propose two methods for finding similarities in protein structure databases. Our techniques extract feature vectors on triplets of SSEs (Secondary Structure Elements) of prote...
ADBIS
1998
Springer
14 years 7 days ago
1998
Springer
In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for process...
XSYM
2007
Springer
14 years 2 months ago
2007
Springer
Several web applications (such as processing RSS feeds or web service messages) rely on XPath-based data manipulation tools. Web developers need to use XPath queries effectively o...
SAT
2004
Springer
14 years 1 months ago
2004
Springer
Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. We study the Boolean conjunctive queries under a mor...