1552 search results - page 5 / 311 » Creating Database Queries by Demonstration |
ICDE
2001
IEEE
14 years 8 months ago
2001
IEEE
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
ICDE
2007
IEEE
14 years 8 months ago
2007
IEEE
We introduce a novel method of indexing graph databases in order to facilitate subgraph isomorphism and similarity queries. The index is comprised of two major data structures. Th...
ICDE
2011
IEEE
12 years 11 months ago
2011
IEEE
— Although efficient processing of probabilistic databases is a well-established field, a wide range of applications are still unable to benefit from these techniques due to t...
ICDE
2008
IEEE
14 years 8 months ago
2008
IEEE
In this paper we explore database segmentation in the context of a column-store DBMS targeted at a scientific database. We present a novel hardware- and scheme-oblivious segmentati...
DEXAW
1999
IEEE
13 years 11 months ago
1999
IEEE
ing spatio-temporal data as abstract data types into already existing data models is a promising approach to creating spatio-temporal query languages. In this context, an importan...