16666 search results - page 2673 / 3334 » Descriptive and Computational Complexity |
282
Voted
SIGMOD
2007
ACM
16 years 7 months ago
2007
ACM
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
216
click to vote
SIGMOD
2005
ACM
16 years 7 months ago
2005
ACM
With rapid advances in video processing technologies and ever fast increments in network bandwidth, the popularity of video content publishing and sharing has made similarity sear...
182
click to vote
SIGMOD
2001
ACM
16 years 7 months ago
2001
ACM
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
184
Voted
PODS
2002
ACM
16 years 7 months ago
2002
ACM
We study two classes of view update problems in relational databases. We are given a source database S, a monotone query Q, and the view Q(S) generated by the query. The first pro...
217
Voted
PODS
2008
ACM
16 years 7 months ago
2008
ACM
Data exchange, also known as data translation, has been extensively investigated in recent years. One main direction of research has focused on the semantics and the complexity of...