Sciweavers

765 search results - page 86 / 153
» Query Processing over Incomplete Autonomous Databases
Sort
View
JOLLI
2010
94views more  JOLLI 2010»
14 years 8 months ago
Querying Linguistic Trees
Large databases of linguistic annotations are used for testing linguistic hypotheses and for training language processing models. These linguistic annotations are often syntactic ...
Catherine Lai, Steven Bird
EDBT
2010
ACM
145views Database» more  EDBT 2010»
15 years 1 months ago
Splash: ad-hoc querying of data and statistical models
Data mining is increasingly performed by people who are not computer scientists or professional programmers. It is often done as an iterative process involving multiple ad-hoc tas...
Lujun Fang, Kristen LeFevre
WWW
2011
ACM
14 years 5 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...
SIGMOD
1998
ACM
166views Database» more  SIGMOD 1998»
15 years 2 months ago
CONTROL: Continuous Output and Navigation Technology with Refinement On-Line
The CONTROL project at U.C. Berkeley has developed technologies to provide online behavior for data-intensive applications. Using new query processing algorithms, these technologi...
Ron Avnur, Joseph M. Hellerstein, Bruce Lo, Chris ...
VLDB
1999
ACM
133views Database» more  VLDB 1999»
15 years 2 months ago
Online Dynamic Reordering for Interactive Data Processing
We present a pipelining, dynamically usercontrollable reorder operator, for use in dataintensive applications. Allowing the user to reorder the data delivery on the fly increases...
Vijayshankar Raman, Bhaskaran Raman, Joseph M. Hel...