17760 search results - page 3137 / 3552 » A Generalization of the Massey-Ding Algorithm |
269
Voted
VLDB
2007
ACM
16 years 7 months ago
2007
ACM
A "plan diagram" is a pictorial enumeration of the execution plan choices of a database query optimizer over the relational selectivity space. We have shown recently tha...
293
Voted
VLDB
2007
ACM
16 years 7 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...
305
Voted
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
Labeling schemes lie at the core of query processing for many XML database management systems. Designing labeling schemes for dynamic XML documents is an important problem that ha...
308
Voted
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
295
Voted
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
The skyline of a d-dimensional dataset consists of all points not dominated by others. The incorporation of the skyline operator into practical database systems necessitates an ef...