Sciweavers

8249 search results - page 62 / 1650
» The DBO database system
Sort
View
ICDE
2012
IEEE
277views Database» more  ICDE 2012»
11 years 10 months ago
Lookup Tables: Fine-Grained Partitioning for Distributed Databases
—The standard way to scale a distributed OLTP DBMS is to horizontally partition data across several nodes. Ideally, this results in each query/transaction being executed at just ...
Aubrey Tatarowicz, Carlo Curino, Evan P. C. Jones,...
CORR
2002
Springer
187views Education» more  CORR 2002»
13 years 7 months ago
Answer Sets for Consistent Query Answering in Inconsistent Databases
A relational database is inconsistent if it does not satisfy a given set of integrity constraints. Nevertheless, it is likely that most of the data in it is consistent with the co...
Marcelo Arenas, Leopoldo E. Bertossi, Jan Chomicki
JCSS
2000
71views more  JCSS 2000»
13 years 7 months ago
Path Constraints in Semistructured Databases
We investigate a class of path constraints that is of interest in connection with both semistructured and structured data. In standard database systems, constraints are typically ...
Peter Buneman, Wenfei Fan, Scott Weinstein
NAR
2011
189views Computer Vision» more  NAR 2011»
12 years 11 months ago
EDULISS: a small-molecule database with data-mining and pharmacophore searching capabilities
We present the relational database EDULISS (EDinburgh University Ligand Selection System), which stores structural, physicochemical and pharmacophoric properties of small molecule...
Kun-Yi Hsin, Hugh P. Morgan, Steven R. Shave, Andr...
JIIS
2000
111views more  JIIS 2000»
13 years 7 months ago
Multidimensional Index Structures in Relational Databases
Abstract. Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on effi...
Christian Böhm, Stefan Berchtold, Hans-Peter ...