Sciweavers

613 search results - page 69 / 123
» Query Evaluation on a Database Given by a Random Graph
Sort
View
229
Voted
SIGMOD
2008
ACM
191views Database» more  SIGMOD 2008»
16 years 3 months ago
Efficient aggregation for graph summarization
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
Yuanyuan Tian, Richard A. Hankins, Jignesh M. Pate...
120
Voted
ACTA
2006
104views more  ACTA 2006»
15 years 3 months ago
Safe projections of binary data sets
Abstract Selectivity estimation of a boolean query based on frequent itemsets can be solved by describing the problem by a linear program. However, the number of variables in the e...
Nikolaj Tatti
150
Voted
BMCBI
2008
173views more  BMCBI 2008»
15 years 3 months ago
Extraction of semantic biomedical relations from text using conditional random fields
Background: The increasing amount of published literature in biomedicine represents an immense source of knowledge, which can only efficiently be accessed by a new generation of a...
Markus Bundschus, Mathäus Dejori, Martin Stet...
136
Voted
EDBT
2004
ACM
147views Database» more  EDBT 2004»
16 years 3 months ago
Projection Pushing Revisited
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...
146
Voted
WWW
2008
ACM
16 years 4 months ago
Efficiently querying rdf data in triple stores
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...