Sciweavers

6004 search results - page 584 / 1201
» Parallelizing query optimization
Sort
View
OWLED
2008
15 years 7 months ago
Owlgres: A Scalable OWL Reasoner
Abstract. We present Owlgres, a DL-Lite reasoner implementation written for PostgreSQL, a mature open source database. Owlgres is an OWL reasoner that provides consistency checking...
Markus Stocker, Michael Smith
CORR
2008
Springer
125views Education» more  CORR 2008»
15 years 6 months ago
Adversary lower bounds for nonadaptive quantum algorithms
We present two general methods for proving lower bounds on the query complexity of nonadaptive quantum algorithms. Both methods are based on the adversary method of Ambainis. We sh...
Pascal Koiran, Jürgen Landes, Natacha Portier...
DKE
2007
136views more  DKE 2007»
15 years 6 months ago
Deciding XPath containment with MSO
XPath is the standard language for addressing parts of an XML document. We present a sound and complete decision procedure for containment of XPath queries. The considered XPath f...
Pierre Genevès, Nabil Layaïda
PROCEDIA
2010
113views more  PROCEDIA 2010»
15 years 4 months ago
Exploring utilisation of GPU for database applications
This study is devoted to exploring possible applications of GPU technology for acceleration of the database access. We use the n-gram based approximate text search engine as a tes...
Slawomir Walkowiak, Konrad Wawruch, Marita Nowotka...
SODA
2010
ACM
144views Algorithms» more  SODA 2010»
15 years 4 months ago
Cell-Probe Lower Bounds for Succinct Partial Sums
The partial sums problem in succinct data structures asks to preprocess an array A[1 . . n] of bits into a data structure using as close to n bits as possible, and answer queries ...
Mihai Patrascu, Emanuele Viola