Titlebook: Database and Expert Systems Applications; 21st International C Pablo García Bringas,Abdelkader Hameurlain,Gerald Conference proceedings 20

Individual

Minimum Spanning Tree on Spatio-Temporal Networksted with one or more time intervals; during these time intervals, the total cost of this spanning tree is the least among all spanning trees. The TSMST problem aims to identify a collection of distinct minimum spanning trees and their respective time-sub-intervals. This is an important problem in sp

輕率看法

Real-Time Temporal Data Warehouse Cubing required. For these applications, data should be incorporated in the warehouse and made available as soon as possible in “Real Time Data Warehouse”. In this paper we propose an indexing model named TiC-Tree, in order to simultaneously index and store multidimensional detailed and aggregated data. O

antenna

PAGER: Parameterless, Accurate, Generic, Efficient ,NN-Based Regressionn algorithms are used for prediction (including forecasting of time-series data), inference, hypothesis testing, and modeling of causal relationships. Although this problem has been studied extensively, most of these approaches are not generic in that they require the user to make an intelligent gue

Largess

冒煙

Towards Efficient Mining of Periodic-Frequent Patterns in Transactional Databasessupport (.) and maximum periodicity (.) constraints. . constraint controls the minimum number of transactions that a pattern must cover in a database. . constraint controls the maximum duration between the two transactions below which a pattern should reoccur in a database. In the literature an appr

phase-2-enzyme

品嘗你的人

An Efficient Computation of Frequent Queries in a Star Schemaing functional and inclusion dependencies, computing frequent conjunctive queries becomes feasible for databases operating over a star schema. However, the implementation considered in this previous work showed severe limitations for large fact tables. The main contribution of this paper is to overc

發(fā)怨言

Evaluating Evidences for Keyword Query Disambiguation in Entity Centric Database Searchguation process relies on a proper assessment of whether a structured query represents the intent behind the keyword query. In this paper we systematically analyze a number of intuitive statistical measures that can potentially be used in this disambiguation process. We evaluate the impact of these

易彎曲

Consequence