1042 search results - page 125 / 209 » Constraint Databases, Data Structures and Efficient Query Ev... |
222
click to vote
ICDE
2002
IEEE
16 years 3 months ago
2002
IEEE
We propose a novel approach to shape-based image retrieval that builds upon a similarity criterion which is based on the average point set distance. Compared to traditional techni...
123
click to vote
SIGMOD
2004
ACM
16 years 2 months ago
2004
ACM
Dynamic plan migration is concerned with the on-the-fly transition from one continuous query plan to a semantically equivalent yet more efficient plan. Migration is important for ...
143
click to vote
DEXAW
2006
IEEE
15 years 8 months ago
2006
IEEE
The effective grouping, or partitioning, of semistructured data is of fundamental importance when providing support for queries. Partitions allow items within the data set that sh...
224
click to vote
ICDE
2005
IEEE
16 years 3 months ago
2005
IEEE
We present ViteX, an XPath processing system on XML streams with polynomial time complexity. ViteX uses a polynomial-space data structure to encode an exponential number of patter...
116
Voted
ICDE
2006
IEEE
15 years 8 months ago
2006
IEEE
XML structural joins, which evaluate the containment (ancestor-descendant) relationships between XML elements, are important operations of XML query processing. Estimating structu...