Sciweavers

36 search results - page 3 / 8
» A Discussion on the Design of Graph Database Benchmarks
Sort
View
WWW
2008
ACM
14 years 7 months ago
SPARQL basic graph pattern optimization using selectivity estimation
In this paper, we formalize the problem of Basic Graph Pattern (BGP) optimization for SPARQL queries and main memory graph implementations of RDF data. We define and analyze the c...
Markus Stocker, Andy Seaborne, Abraham Bernstein, ...
ICDE
2010
IEEE
172views Database» more  ICDE 2010»
14 years 1 months ago
Rule profiling for query optimizers and their implications
—Many modern optimizers use a transformation rule based framework. While there has been a lot of work on identifying new transformation rules, there has been little work focused ...
Surajit Chaudhuri, Leo Giakoumakis, Vivek R. Naras...
ECCV
2010
Springer
13 years 3 months ago
An Efficient Graph Cut Algorithm for Computer Vision Problems
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...
Chetan Arora, Subhashis Banerjee, Prem Kalra, S. N...
IDS
1994
128views Database» more  IDS 1994»
13 years 10 months ago
Virtual Environments for Data Sharing and Visualisation - Populated Information Terrains
The Concept of Populated Information Terrains (PITS) aims to extend database technology with key ideas from the new fields of Virtual Reality (VR) and Computer Supported Cooperativ...
Steve Benford, John A. Mariani
SIGMOD
2010
ACM
281views Database» more  SIGMOD 2010»
13 years 11 months ago
Continuous sampling for online aggregation over multiple queries
In this paper, we propose an online aggregation system called COSMOS (Continuous Sampling for Multiple queries in an Online aggregation System), to process multiple aggregate quer...
Sai Wu, Beng Chin Ooi, Kian-Lee Tan