Sciweavers

817 search results - page 112 / 164
» Generating Efficient Plans for Queries Using Views
Sort
View
151
Voted
EDBT
2009
ACM
170views Database» more  EDBT 2009»
15 years 6 months ago
Efficient constraint evaluation in categorical sequential pattern mining for trajectory databases
The classic Generalized Sequential Patterns (GSP) algorithm returns all frequent sequences present in a database. However, usually a few ones are interesting from a user's po...
Leticia I. Gómez, Alejandro A. Vaisman
115
Voted
TSP
2008
139views more  TSP 2008»
15 years 2 months ago
Bayesian Filtering With Random Finite Set Observations
This paper presents a novel and mathematically rigorous Bayes recursion for tracking a target that generates multiple measurements with state dependent sensor field of view and clu...
Ba-Tuong Vo, Ba-Ngu Vo, Antonio Cantoni
CIKM
2006
Springer
15 years 6 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 ...
242
Voted
ICDE
2009
IEEE
147views Database» more  ICDE 2009»
16 years 4 months ago
Separating Authentication from Query Execution in Outsourced Databases
-- In the database outsourcing paradigm, a data owner (DO) delegates its DBMS administration to a specialized service provider (SP) that receives and processes queries from clients...
Stavros Papadopoulos, Dimitris Papadias, Weiwei Ch...
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
16 years 3 months ago
Reasoning about sets using redescription mining
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
Mohammed Javeed Zaki, Naren Ramakrishnan