Sciweavers

6654 search results - page 233 / 1331
» Querying Faceted Databases
Sort
View
ICEBE
2005
IEEE
168views Business» more  ICEBE 2005»
16 years 7 days ago
Frequency Operators for Condensative Queries over Data Streams
Over a traditional Database Management System (DBMS), the answer to an aggregate query is usually much smaller than the answer to a similar nonaggregate query. Therefore, we call ...
Lisha Ma, Werner Nutt
PODS
2003
ACM
113views Database» more  PODS 2003»
16 years 6 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
ICDT
2012
ACM
226views Database» more  ICDT 2012»
13 years 9 months ago
Factorised representations of query results: size bounds and readability
We introduce a representation system for relational data based on algebraic factorisation using distributivity of product over union and commutativity of product and union. We giv...
Dan Olteanu, Jakub Zavodny
BTW
2007
Springer
142views Database» more  BTW 2007»
16 years 24 days ago
Visually Exploring and Querying XML with BaseX
Abstract: XML documents are widely used as a generic container for textual contents. As they are increasingly growing in size, XML databases have come up to efficiently store and q...
Christian Grün, Alexander Holupirek, Marc H. ...
BXML
2003
15 years 8 months ago
Querying transformed XML documents: Determining a sufficient fragment of the original document
Large XML documents which are stored in an XML database can be transformed further by an XSL processor using an XSLT stylesheet. In order to answer an XPath query based on the tran...
Sven Groppe, Stefan Böttcher