Sciweavers

815 search results - page 95 / 163
» Ontology-based integration for relational databases
Sort
View
SIGMOD
2007
ACM
160views Database» more  SIGMOD 2007»
15 years 10 months ago
Supporting ranking and clustering as generalized order-by and group-by
The Boolean semantics of SQL queries cannot adequately capture the "fuzzy" preferences and "soft" criteria required in non-traditional data retrieval applicati...
Chengkai Li, Min Wang, Lipyeow Lim, Haixun Wang, K...
ICDE
2008
IEEE
135views Database» more  ICDE 2008»
15 years 11 months ago
Online Filtering, Smoothing and Probabilistic Modeling of Streaming data
In this paper, we address the problem of extending a relational database system to facilitate efficient real-time application of dynamic probabilistic models to streaming data. he ...
Bhargav Kanagal, Amol Deshpande
VLDB
2006
ACM
147views Database» more  VLDB 2006»
15 years 10 months ago
Answering queries using materialized views with minimum size
In this paper we study the following problem. Given a database and a set of queries, we want to find a set of views that can compute the answers to the queries, such that the amoun...
Rada Chirkova, Chen Li, Jia Li
VLDB
2003
ACM
141views Database» more  VLDB 2003»
15 years 10 months ago
Computing complete answers to queries in the presence of limited access patterns
In data applications such as information integration, there can be limited access patterns to relations, i.e., binding patterns require values to be specified for certain attribut...
Chen Li
PODS
2005
ACM
86views Database» more  PODS 2005»
15 years 3 months ago
An incremental algorithm for computing ranked full disjunctions
The full disjunction is a variation of the join operator that maximally combines tuples from connected relations, while preserving all information in the relations. The full disju...
Sara Cohen, Yehoshua Sagiv