Sciweavers

16082 search results - page 2830 / 3217
» Fireworks Algorithm for Optimization
Sort
View
320
Voted
SIGMOD
2009
ACM
192views Database» more  SIGMOD 2009»
16 years 7 months ago
Scalable join processing on very large RDF graphs
With the proliferation of the RDF data format, engines for RDF query processing are faced with very large graphs that contain hundreds of millions of RDF triples. This paper addre...
Thomas Neumann, Gerhard Weikum
294
Voted
SIGMOD
2006
ACM
114views Database» more  SIGMOD 2006»
16 years 7 months ago
Ordering the attributes of query results
There has been a great deal of interest in the past few years on ranking of results of queries on structured databases, including work on probabilistic information retrieval, rank...
Gautam Das, Vagelis Hristidis, Nishant Kapoor, S. ...
SIGMOD
2003
ACM
108views Database» more  SIGMOD 2003»
16 years 7 months ago
Composing XSL Transformations with XML Publishing Views
While the XML Stylesheet Language for Transformations (XSLT) was not designed as a query language, it is well-suited for many query-like operations on XML documents including sele...
Chengkai Li, Philip Bohannon, Henry F. Korth, P. P...
183
Voted
PODS
2003
ACM
113views Database» more  PODS 2003»
16 years 7 months ago
Materializing views with minimal size to answer queries
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...
Rada Chirkova, Chen Li
EDBT
2004
ACM
155views Database» more  EDBT 2004»
16 years 7 months ago
Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
Alan Nash, Bertram Ludäscher
« Prev « First page 2830 / 3217 Last » Next »