Sciweavers

1968 search results - page 90 / 394
» The Complexity of Valued Constraint Models
Sort
View
DEXA
2005
Springer
80views Database» more  DEXA 2005»
15 years 7 months ago
Optimizing I/O Costs of Multi-dimensional Queries Using Bitmap Indices
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
Doron Rotem, Kurt Stockinger, Kesheng Wu
RTSS
1997
IEEE
15 years 5 months ago
On adaptive resource allocation for complex real-time application
Resource allocation for high-performance real-time applications is challenging due to the applications' data-dependent nature, dynamic changes in their external environment, ...
Daniela Rosu, Karsten Schwan, Sudhakar Yalamanchil...
NCA
2007
IEEE
15 years 29 days ago
Safety management of complex technology
One of the key success factors behind the human species is the ability to think, plan and pursue goals. Apart from wisdom and tacit knowledge, experience and awareness of the phys...
Ali G. Hessami
ICDE
2006
IEEE
428views Database» more  ICDE 2006»
16 years 2 months ago
Integrating Unstructured Data into Relational Databases
In this paper we present a system for automatically integrating unstructured text into a multi-relational database using state-of-the-art statistical models for structure extracti...
Imran R. Mansuri, Sunita Sarawagi
DEXA
2000
Springer
147views Database» more  DEXA 2000»
15 years 5 months ago
Lattice-Structured Domains, Imperfect Data and Inductive Queries
The relational model, as proposed by Codd, contained the concept of relations as tables composed of tuples of single valued attributes taken from a domain. In most of the early lit...
Sally Rice, John F. Roddick