Sciweavers

228 search results - page 10 / 46
» Relational queries over interpreted structures
Sort
View
BMCBI
2006
183views more  BMCBI 2006»
15 years 4 months ago
Mining gene expression data by interpreting principal components
Background: There are many methods for analyzing microarray data that group together genes having similar patterns of expression over all conditions tested. However, in many insta...
Joseph C. Roden, Brandon W. King, Diane Trout, Ali...
159
Voted
ER
2010
Springer
164views Database» more  ER 2010»
15 years 2 months ago
Querying Databases with Taxonomies
Traditional information search in which queries are posed against a known and rigid schema over a structured database is shifting towards a Web scenario in which exposed schemas ar...
Davide Martinenghi, Riccardo Torlone
KDID
2004
481views Database» more  KDID 2004»
15 years 5 months ago
Models and Indices for Integrating Unstructured Data with a Relational Database
Abstract. Database systems are islands of structure in a sea of unstructured data sources. Several real-world applications now need to create bridges for smooth integration of semi...
Sunita Sarawagi
ICDE
2010
IEEE
273views Database» more  ICDE 2010»
16 years 3 months ago
WikiAnalytics: Ad-hoc Querying of Highly Heterogeneous Structured Data
Searching and extracting meaningful information out of highly heterogeneous datasets is a hot topic that received a lot of attention. However, the existing solutions are based on e...
Andrey Balmin, Emiran Curtmola
ICALP
2007
Springer
15 years 10 months ago
A Combinatorial Theorem for Trees
Following the idea developed by I. Simon in his theorem of Ramseyan factorisation forests, we develop a result of ‘deterministic factorisations’. This extra determinism propert...
Thomas Colcombet