Sciweavers

2850 search results - page 184 / 570
» Answering Queries using Humans, Algorithms and Databases
Sort
View
170
Voted
WWW
2011
ACM
14 years 10 months ago
Rewriting queries on SPARQL views
The problem of answering SPARQL queries over virtual SPARQL views is commonly encountered in a number of settings, including while enforcing security policies to access RDF data, ...
Wangchao Le, Songyun Duan, Anastasios Kementsietsi...
204
Voted
ICDT
2009
ACM
105views Database» more  ICDT 2009»
16 years 4 months ago
Efficient data structures for range-aggregate queries on trees
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
Hao Yuan, Mikhail J. Atallah
DAWAK
1999
Springer
15 years 7 months ago
Implementation of Multidimensional Index Structures for Knowledge Discovery in Relational Databases
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient quer...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
141
Voted
JIIS
2000
111views more  JIIS 2000»
15 years 3 months ago
Multidimensional Index Structures in Relational Databases
Abstract. Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on effi...
Christian Böhm, Stefan Berchtold, Hans-Peter ...
126
Voted
WWW
2004
ACM
16 years 4 months ago
Index structures and algorithms for querying distributed RDF repositories
A technical infrastructure for storing, querying and managing RDF data is a key element in the current semantic web development. Systems like Jena, Sesame or the ICS-FORTH RDF Sui...
Heiner Stuckenschmidt, Richard Vdovjak, Geert-Jan ...