Sciweavers

2635 search results - page 248 / 527
» Algorithms for the Database Layout Problem
Sort
View
ICDE
2007
IEEE
113views Database» more  ICDE 2007»
16 years 8 months ago
Reducing Order Enforcement Cost in Complex Query Plans
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...
Ravindra Guravannavar, S. Sudarshan
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
16 years 6 months ago
ViewJoin: Efficient View-based Evaluation of Tree Pattern Queries
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
Ding Chen, Chee-Yong Chan
ICDT
2010
ACM
259views Database» more  ICDT 2010»
16 years 4 months ago
Forward-XPath and extended register automata on data-trees
We consider a fragment of XPath named `forward-XPath', which contains all descendant and rightwards sibling axes as well as data equality and inequality tests. The satisfiabi...
Diego Figueira
DASFAA
2007
IEEE
190views Database» more  DASFAA 2007»
16 years 29 days ago
Clustering Moving Objects in Spatial Networks
Advances in wireless networks and positioning technologies (e.g., GPS) have enabled new data management applications that monitor moving objects. In such new applications, realtime...
Jidong Chen, Caifeng Lai, Xiaofeng Meng, Jianliang...
KDD
1995
ACM
148views Data Mining» more  KDD 1995»
15 years 10 months ago
Learning Arbiter and Combiner Trees from Partitioned Data for Scaling Machine Learning
Knowledge discovery in databases has become an increasingly important research topic with the advent of wide area network computing. One of the crucial problems we study in this p...
Philip K. Chan, Salvatore J. Stolfo