Sciweavers

2070 search results - page 97 / 414
» Querying Communities in Relational Databases
Sort
View
EUSFLAT
2003
107views Fuzzy Logic» more  EUSFLAT 2003»
15 years 14 days ago
A framework for multicriteria selection based on measuring query responses
This paper deals with a problem of multicriteria selection assuming uncertainties including linguistic modifiers both in given data and in queries referring to these data. An app...
Milos Seda, Jiri Dvorak
VLDB
1991
ACM
135views Database» more  VLDB 1991»
15 years 2 months ago
A Framework for Automating Physical Database Design
We propose a two-pha.se algorithm for physical database design. In phase one the algorithm, for each logical query, losesrules to determine characteristics of a physical design (s...
Steve Rozen, Dennis Shasha
IDEAS
2008
IEEE
153views Database» more  IDEAS 2008»
15 years 5 months ago
Pattern based processing of XPath queries
As the popularity of areas including document storage and distributed systems continues to grow, the demand for high performance XML databases is increasingly evident. This has le...
Gerard Marks, Mark Roantree
CORR
2002
Springer
187views Education» more  CORR 2002»
14 years 11 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
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
15 years 2 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen