Sciweavers

4965 search results - page 851 / 993
» A Simple Abstraction for Data Modeling
Sort
View
BTW
2003
Springer
94views Database» more  BTW 2003»
15 years 11 months ago
The Paradigm of Relational Indexing: a Survey
Abstract: In order to achieve efficient execution plans for queries comprising userdefined data types and predicates, the database system has to be provided with appropriate index ...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
SIGMOD
2010
ACM
377views Database» more  SIGMOD 2010»
15 years 11 months ago
Online aggregation and continuous query support in MapReduce
MapReduce is a popular framework for data-intensive distributed computing of batch jobs. To simplify fault tolerance, the output of each MapReduce task and job is materialized to ...
Tyson Condie, Neil Conway, Peter Alvaro, Joseph M....
SEMWEB
2001
Springer
15 years 11 months ago
Utilizing Host-Formalisms to Extend RDF-Semantics
Abstract. RDF may be considered as an application of XML intended to interoperably exchange semantics between Web applications. In its current form, this objective may be hard to r...
Wolfram Conen, Reinhold Klapsing
DEXA
2000
Springer
99views Database» more  DEXA 2000»
15 years 10 months ago
The BORD Benchmark for Object-Relational Databases
This paper describes a new benchmark for object-relational DBMSs, the Benchmark for Object-Relational Databases (BORD). BORD has been developed to evaluate system performance pecul...
Sang Ho Lee, Sung Jin Kim, Won Kim
ICALP
1992
Springer
15 years 10 months ago
Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine
Abstract Bernard Chazelle Department of Computer Science Princeton University Burton Rosenberg Department of Mathematics and Computer Science Dartmouth College We give a lower bou...
Bernard Chazelle, Burton Rosenberg