Sciweavers

1300 search results - page 162 / 260
» XML Query Processing and Optimization
Sort
View
VLDB
1998
ACM
120views Database» more  VLDB 1998»
15 years 6 months ago
Algorithms for Querying by Spatial Structure
: Structural queries constitute a special form of content-basedretrieval where the user specifiesa set of spatial constraints among query variables and asks for all configurations ...
Dimitris Papadias, Nikos Mamoulis, Vasilis Delis
ECML
2005
Springer
15 years 7 months ago
Active Learning in Partially Observable Markov Decision Processes
This paper examines the problem of finding an optimal policy for a Partially Observable Markov Decision Process (POMDP) when the model is not known or is only poorly specified. W...
Robin Jaulmes, Joelle Pineau, Doina Precup
FGCS
2000
81views more  FGCS 2000»
15 years 1 months ago
Managing the operator ordering problem in parallel databases
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...
Harald Kosch
CIKM
2006
Springer
15 years 5 months ago
Heuristic containment check of partial tree-pattern queries in the presence of index graphs
The wide adoption of XML has increased the interest of the database community on tree-structured data management techniques. Querying capabilities are provided through tree-patter...
Dimitri Theodoratos, Stefanos Souldatos, Theodore ...
WAIM
2004
Springer
15 years 7 months ago
Learning-Based Top-N Selection Query Evaluation over Relational Databases
A top-N selection query against a relation is to find the N tuples that satisfy the query condition the best but not necessarily completely. In this paper, we propose a new method ...
Liang Zhu, Weiyi Meng