Sciweavers

1402 search results - page 248 / 281
» Searching Cycle-Disjoint Graphs
Sort
View
EDBT
2012
ACM
247views Database» more  EDBT 2012»
11 years 11 months ago
Heuristics-based query optimisation for SPARQL
Query optimization in RDF Stores is a challenging problem as SPARQL queries typically contain many more joins than equivalent relational plans, and hence lead to a large join orde...
Petros Tsialiamanis, Lefteris Sidirourgos, Irini F...
ICDE
1998
IEEE
103views Database» more  ICDE 1998»
14 years 10 months ago
Online Generation of Association Rules
We have a large database consisting of sales transactions. We investigate the problem of online mining of association rules in this large database. We show how to preprocess the d...
Charu C. Aggarwal, Philip S. Yu
DAC
2005
ACM
14 years 9 months ago
Efficient SAT solving: beyond supercubes
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
Domagoj Babic, Jesse D. Bingham, Alan J. Hu
WWW
2006
ACM
14 years 9 months ago
Web ontology segmentation: analysis, classification and use
Ontologies are at the heart of the semantic web. They define the concepts and relationships that make global interoperability possible. However, as these ontologies grow in size t...
Julian Seidenberg, Alan L. Rector
WWW
2004
ACM
14 years 9 months ago
The effect of the back button in a random walk: application for pagerank
Theoretical analysis of the Web graph is often used to improve the efficiency of search engines. The PageRank algorithm, proposed by [5], is used by the Google search engine [4] t...
Fabien Mathieu, Mohamed Bouklit