Sciweavers

2889 search results - page 175 / 578
» Querying Structured Hyperdocuments
Sort
View
FOCS
1998
IEEE
14 years 15 days ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
EDBT
2010
ACM
164views Database» more  EDBT 2010»
13 years 11 months ago
Techniques for efficiently querying scientific workflow provenance graphs
A key advantage of scientific workflow systems over traditional scripting approaches is their ability to automatically record data and process dependencies introduced during workf...
Manish Kumar Anand, Shawn Bowers, Bertram Ludä...
SSDBM
2006
IEEE
197views Database» more  SSDBM 2006»
14 years 2 months ago
InterJoin: Exploiting Indexes and Materialized Views in XPath Evaluation
XML has become the standard for data exchange for a wide variety of applications, particularly in the scientific community. In order to efficiently process queries on XML repres...
Derek Phillips, Ning Zhang 0002, Ihab F. Ilyas, M....
SIGIR
2011
ACM
12 years 11 months ago
Faster top-k document retrieval using block-max indexes
Large search engines process thousands of queries per second over billions of documents, making query processing a major performance bottleneck. An important class of optimization...
Shuai Ding, Torsten Suel
VISUALIZATION
1998
IEEE
14 years 15 days ago
Interactive out-of-core isosurface extraction
In this paper, we present a novel out-of-core technique for the interactive computation of isosurfaces from volume data. Our algorithm minimizes the main memory and disk space req...
Yi-Jen Chiang, Cláudio T. Silva, William J....