Sciweavers

1709 search results - page 169 / 342
» Comparing the Performance of Database Selection Algorithms
Sort
View
PAKDD
2004
ACM
186views Data Mining» more  PAKDD 2004»
15 years 11 months ago
CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees
Abstract. Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in ...
Yun Chi, Yirong Yang, Yi Xia, Richard R. Muntz
ICDE
2005
IEEE
122views Database» more  ICDE 2005»
15 years 12 months ago
Signature-based Filtering Techniques for Structural Joins of XML Data
Queries on XML documents typically combine selections on element contents, and, via path expressions, the structural relationships between tagged elements. Efficient support for ...
Huan Huo, Guoren Wang, Chuan Yang, Rui Zhou
PVLDB
2010
147views more  PVLDB 2010»
15 years 4 months ago
HYRISE - A Main Memory Hybrid Storage Engine
In this paper, we describe a main memory hybrid database system called HYRISE, which automatically partitions tables into vertical partitions of varying widths depending on how th...
Martin Grund, Jens Krüger, Hasso Plattner, Al...
IJCNN
2000
IEEE
15 years 10 months ago
Supervised Scaled Regression Clustering: An Alternative to Neural Networks
: This paper describes a rather novel method for the supervised training of regression systems that can be an alternative to feedforward Artificial Neural Networks (ANNs) trained w...
Mark J. Embrechts, Dirk Devogelaere, Marcel Rijcka...
EUC
2004
Springer
15 years 10 months ago
Efficient Scheduling for Design Exploration with Imprecise Latency and Register Constraints
In archiectural synthesis, scheduling and resource allocation are important steps. During the early stage of the design, imprecise information is unavoidable. Under the imprecise ...
Chantana Chantrapornchai, Wanlop Surakumpolthorn, ...