2031 search results - page 377 / 407 » On Tree-Constrained Matchings and Generalizations |
SIGMOD
2008
ACM
14 years 10 months ago
2008
ACM
We study the problem of querying relational data embedded in XML. Relational data can be represented by various tree structures in XML. However, current XML query methods, such as...
SIGMOD
2008
ACM
14 years 10 months ago
2008
ACM
Today's query processing engines do not take advantage of the multiple occurrences of a relation in a query to improve performance. Instead, each instance is treated as a dis...
SIGMOD
2008
ACM
14 years 10 months ago
2008
ACM
In the implementation of hosted business services, multiple tenants are often consolidated into the same database to reduce total cost of ownership. Common practice is to map mult...
SIGMOD
2007
ACM
14 years 10 months ago
2007
ACM
Database queries are often exploratory and users often find their queries return too many answers, many of them irrelevant. Existing work either categorizes or ranks the results t...
SIGMOD
2007
ACM
14 years 10 months ago
2007
ACM
Many database applications require the analysis and processing of data streams. In such systems, huge amounts of data arrive rapidly and their values change over time. The variati...