Sciweavers

734 search results - page 16 / 147
» Efficient join processing over uncertain data
Sort
View
IJSWIS
2008
135views more  IJSWIS 2008»
14 years 9 months ago
Efficient Processing of RDF Queries with Nested Optional Graph Patterns in an RDBMS
Relational technology has shown to be very useful for scalable Semantic Web data management. Numerous researchers have proposed to use RDBMSs to store and query voluminous RDF dat...
Artem Chebotko, Shiyong Lu, Mustafa Atay, Farshad ...
70
Voted
BMCBI
2007
97views more  BMCBI 2007»
14 years 9 months ago
A procedure for the estimation over time of metabolic fluxes in scenarios where measurements are uncertain and/or insufficient
Background: An indirect approach is usually used to estimate the metabolic fluxes of an organism: couple the available measurements with known biological constraints (e.g. stoichi...
Francisco Llaneras, Jesús Picó
79
Voted
EDBT
2004
ACM
162views Database» more  EDBT 2004»
15 years 9 months ago
Non-contiguous Sequence Pattern Queries
Abstract. Non-contiguous subsequence pattern queries search for symbol instances in a long sequence that satisfy some soft temporal constraints. In this paper, we propose a methodo...
Nikos Mamoulis, Man Lung Yiu
VLDB
1991
ACM
143views Database» more  VLDB 1991»
15 years 1 months ago
Handling Data Skew in Multiprocessor Database Computers Using Partition Tuning
Shared nothing multiprocessor archit.ecture is known t.obe more scalable to support very large databases. Compared to other join strategies, a hash-ba9ed join algorithm is particu...
Kien A. Hua, Chiang Lee
ICDT
2007
ACM
74views Database» more  ICDT 2007»
15 years 1 months ago
World-Set Decompositions: Expressiveness and Efficient Algorithms
Uncertain information is commonplace in real-world data management scenarios. The ability to represent large sets of possible instances (worlds) while supporting efficient storage ...
Lyublena Antova, Christoph Koch, Dan Olteanu