Sciweavers

363 search results - page 14 / 73
» Linked Data Query Processing Strategies
Sort
View
VLDB
1989
ACM
155views Database» more  VLDB 1989»
14 years 1 months ago
Parallel Processing of Recursive Queries in Distributed Architectures
This paper presents a parallel algorithm for recursive query processing and shows how it can be efficiently implemented in a local computer network. The algorithm relies on an int...
Guy Hulin
SIGMOD
2008
ACM
122views Database» more  SIGMOD 2008»
14 years 10 months ago
Building query optimizers for information extraction: the SQoUT project
Text documents often embed data that is structured in nature. This structured data is increasingly exposed using information extraction systems, which generate structured relation...
Alpa Jain, Panagiotis G. Ipeirotis, Luis Gravano
SSDBM
2008
IEEE
131views Database» more  SSDBM 2008»
14 years 4 months ago
Linked Bernoulli Synopses: Sampling along Foreign Keys
Random sampling is a popular technique for providing fast approximate query answers, especially in data warehouse environments. Compared to other types of synopses, random sampling...
Rainer Gemulla, Philipp Rösch, Wolfgang Lehne...
INFOSCALE
2007
ACM
13 years 11 months ago
SDI: a swift tree structure for multi-dimensional data indexing in peer-to-peer networks
Efficient multi-dimensional data search has received much attention in centralized systems. However, its implementation in large-scale distributed systems is not a trivial job and...
Rong Zhang, Weining Qian, Minqi Zhou, Aoying Zhou
CIKM
2009
Springer
14 years 4 months ago
Inverted indexes vs. bitmap indexes in decision support systems
Bitmap indexes are widely used in Decision Support Systems (DSSs) to improve query performance. In this paper, we evaluate the use of compressed inverted indexes with adapted quer...
Truls A. Bjørklund, Nils Grimsmo, Johannes ...