Sciweavers

621 search results - page 21 / 125
» Efficient algorithms for minimizing tree pattern queries
Sort
View
DASFAA
2009
IEEE
104views Database» more  DASFAA 2009»
14 years 2 months ago
On the Discovery of Conserved XML Query Patterns for Evolution-Conscious Caching
Existing xml query pattern-based caching strategies focus on extracting the set of frequently issued query pattern trees (qpt) based on the support of the qpts in the history. Thes...
Sourav S. Bhowmick
BALT
2006
13 years 11 months ago
Introducing Softness into Inductive Queries on String Databases
In many application domains (e.g., WWW mining, molecular biology), large string datasets are available and yet under-exploited. The inductive database framework assumes that both s...
Ieva Mitasiunaite, Jean-François Boulicaut
DASFAA
2010
IEEE
213views Database» more  DASFAA 2010»
13 years 11 months ago
Efficient Algorithms to Monitor Continuous Constrained k Nearest Neighbor Queries
Abstract. Continuous monitoring of spatial queries has received significant research attention in the past few years. In this paper, we propose two efficient algorithms for the con...
Mahady Hasan, Muhammad Aamir Cheema, Wenyu Qu, Xue...
NJC
2006
102views more  NJC 2006»
13 years 8 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
DDECS
2008
IEEE
185views Hardware» more  DDECS 2008»
14 years 2 months ago
Fast Boolean Minimizer for Completely Specified Functions
: We propose a simple and fast two-level minimization algorithm for completely specified functions in this paper. The algorithm is based on processing ternary trees. A ternary tree...
Petr Fiser, Pemysl Rucký, Irena Vanov&aacut...