6650 search results - page 1209 / 1330 » Mutating database queries |
219
Voted
VLDB
2007
ACM
16 years 2 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
215
Voted
VLDB
2008
ACM
16 years 2 months ago
2008
ACM
XML query processing based on labeling schemes has been thoroughly studied in the past several years. Recently efficient processing of updates in dynamic XML data has gained more a...
218
Voted
SIGMOD
2009
ACM
16 years 2 months ago
2009
ACM
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
234
Voted
SIGMOD
2007
ACM
16 years 2 months ago
2007
ACM
The proliferation of database-driven web sites (or web-databases) has brought upon a plethora of applications where both Quality of Service (QoS) and Quality of Data (QoD) are of ...
205
Voted
SIGMOD
2006
ACM
16 years 2 months ago
2006
ACM
Given a d-dimensional data set, a point p dominates another point q if it is better than or equal to q in all dimensions and better than q in at least one dimension. A point is a ...