2859 search results - page 240 / 572 » Querying Complex Structured Databases |
211
click to vote
VLDB
2007
ACM
16 years 18 days ago
2007
ACM
In many applications, the underlying data (the web, an XML document, or a relational database) can be seen as a graph. These graphs may be enriched with weights, associated with t...
188
click to vote
HOTSWUP
2009
ACM
15 years 11 months ago
2009
ACM
The complexity, cost, and down-time currently created by the database schema evolution process is the source of incessant problems in the life of information systems and a major s...
178
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
A query optimizer compares alternative plans in its search space to find the best plan for a given query. Depending on the search space and the enumeration algorithm, optimizers v...
190
click to vote
ICDE
2006
IEEE
16 years 16 days ago
2006
IEEE
To realize the Semantic Web, it will be necessary to make existing database content available for emerging Semantic Web applications, such as web agents and services, which use on...
181
click to vote
ADC
2008
Springer
15 years 8 months ago
2008
Springer
In order to find all occurrences of a tree/twig pattern in an XML database, a number of holistic twig join algorithms have been proposed. However, most of these algorithms focus o...