Sciweavers

327 search results - page 40 / 66
» Efficiently querying rdf data in triple stores
Sort
View
PODS
2003
ACM
113views Database» more  PODS 2003»
14 years 8 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
ICDE
2006
IEEE
174views Database» more  ICDE 2006»
14 years 10 months ago
Extending RDBMSs To Support Sparse Datasets Using An Interpreted Attribute Storage Format
"Sparse" data, in which relations have many attributes that are null for most tuples, presents a challenge for relational database management systems. If one uses the no...
Jennifer L. Beckmann, Alan Halverson, Rajasekar Kr...
CIDR
2009
145views Algorithms» more  CIDR 2009»
13 years 9 months ago
Continuous Analytics: Rethinking Query Processing in a Network-Effect World
Modern data analysis applications driven by the Network Effect are pushing traditional database and data warehousing technologies beyond their limits due to their massively increa...
Michael J. Franklin, Sailesh Krishnamurthy, Neil C...
DEBU
2008
125views more  DEBU 2008»
13 years 8 months ago
Querying XML in Timber
In this paper, we describe the TIMBER XML database system implemented at University of Michigan. TIMBER was one of the first native XML database systems, designed from the ground ...
Yuqing Wu, Stelios Paparizos, H. V. Jagadish
ICDE
2006
IEEE
119views Database» more  ICDE 2006»
14 years 10 months ago
Laws for Rewriting Queries Containing Division Operators
Relational division, also known as small divide, is a derived operator of the relational algebra that realizes a many-to-one set containment test, where a set is represented as a ...
Ralf Rantzau, Christoph Mangold