Sciweavers

192 search results - page 24 / 39
» Using SAT-Solvers to Compute Inference-Proof Database Instan...
Sort
View
108
Voted
TCSV
2008
150views more  TCSV 2008»
14 years 11 months ago
Mining Recurring Events Through Forest Growing
Recurring events are short temporal patterns that consist of multiple instances in the target database. Without any a priori knowledge of the recurring events, in terms of their le...
Junsong Yuan, Jingjing Meng, Ying Wu, Jiebo Luo
ECCB
2005
IEEE
15 years 5 months ago
A query language for biological networks
Many areas of modern biology are concerned with the management, storage, visualization, comparison, and analysis of networks. For instance, networks are used to model signal trans...
Ulf Leser
SIGMOD
2010
ACM
132views Database» more  SIGMOD 2010»
14 years 6 months ago
Durable top-k search in document archives
We propose and study a new ranking problem in versioned databases. Consider a database of versioned objects which have different valid instances along a history (e.g., documents i...
Leong Hou U, Nikos Mamoulis, Klaus Berberich, Srik...
90
Voted
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
15 years 11 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
84
Voted
FSS
2008
105views more  FSS 2008»
14 years 11 months ago
Mining multiple-level fuzzy blocks from multidimensional data
Multidimensional databases are now recognized as being the standard way to store aggregated and historized data. Multidimensional databases are designed to store information on me...
Yeow Wei Choong, Anne Laurent, Dominique Laurent