Sciweavers

1160 search results - page 35 / 232
» Query Processing and Optimization for Pictorial Query Trees
Sort
View
DAWAK
2005
Springer
14 years 4 months ago
Optimizing a Sequence of Frequent Pattern Queries
Discovery of frequent patterns is a very important data mining problem with numerous applications. Frequent pattern mining is often regarded as advanced querying where a user speci...
Mikolaj Morzy, Marek Wojciechowski, Maciej Zakrzew...
NJC
2006
102views more  NJC 2006»
13 years 11 months ago
Online Evaluation of Regular Tree Queries
Regular tree queries (RTQs) are a class of queries considered especially relevant for the expressiveness and evaluation of XML query languages. The algorithms proposed so far for ...
Alexandru Berlea
ICIP
1998
IEEE
15 years 15 days ago
Invariant-based Data Model for Image Databases
We describe a new invariant-based data model for image databases under our approach for shape-based retrieval. The data model relies on contours description of the image shape, an...
Michael Kliot, Ehud Rivlin
COMPGEOM
2010
ACM
14 years 4 months ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan
DASFAA
2007
IEEE
135views Database» more  DASFAA 2007»
14 years 5 months ago
A Development of Hash-Lookup Trees to Support Querying Streaming XML
Abstract. The rapid growth in the amount of XML data and the development of publish-subscribe systems have led to great interest in processing streaming XML data. We propose the Qs...
James Cheng, Wilfred Ng