Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
59
Abstract Grammar-like Functional Rules for Representing Query Optimization Alternatives
"... Extensible query optmuxahon reqmres that the “repertoue ” of alternatIve ..."
Specifying Rule-based Query Optimizers in a Reflective Framework
- Proceedings of the International Conference on Deductive and Object-Oriented Databases
, 1993
"... . Numerous structures for database query optimizers have been proposed. Many of those proposals aimed at automating the construction of query optimizers from some kind of specification of optimizer behavior. These specification frameworks do a good job of partitioning and modularizing the kinds of i ..."
Abstract
-
Cited by 14 (5 self)
- Add to MetaCart
of information needed to generate a query optimizer. Most of them represent at least part of this information in a rule-like form. Nevertheless, large portions of these specifications still take a procedural form. The contributions of this work are threefold. We present a language for specifying optimizers
Mining Approximate Functional Dependencies as Condensed REPRESENTATIONS OF ASSOCIATION RULES
, 2008
"... Approximate Functional Dependencies (AFD) mined from database relations represent potentially interesting patterns and have proven to be useful for various tasks like feature selection for classification, query optimization and query rewriting. Though the discovery of Functional Dependencies (FDs) f ..."
Abstract
-
Cited by 8 (5 self)
- Add to MetaCart
Approximate Functional Dependencies (AFD) mined from database relations represent potentially interesting patterns and have proven to be useful for various tasks like feature selection for classification, query optimization and query rewriting. Though the discovery of Functional Dependencies (FDs
Reasoning about Nested Functional Dependencies
"... Functional dependencies add semantics to a database schema, and are useful for studying various problems, such as database design, query optimization and how dependencies are carried into a view. In the context of a nested relational model, these dependencies can be extended by using path expression ..."
Abstract
-
Cited by 34 (3 self)
- Add to MetaCart
Functional dependencies add semantics to a database schema, and are useful for studying various problems, such as database design, query optimization and how dependencies are carried into a view. In the context of a nested relational model, these dependencies can be extended by using path
Optimal Configuration Design: An Integrated Approach Using Grammars,”
- ASME J. Mech. Des.,
, 1998
"... Introduction Development of performance enhancing designer assistance tools requires research into strategies to capture good design alternatives. In mechanical design, optimization approaches are routinely used to set final parameters of components once basic design concepts, component configurati ..."
Abstract
-
Cited by 24 (0 self)
- Add to MetaCart
that arranges symbols representing power train components into a string, using grammar design rules that assure proper component operation. This FFREADA implementation integrates conceptual design, configuration design and component selection, formulating the design problem into one which is amenable
Author manuscript, published in "ICDT (2012) 46-60" Highly Expressive Query Languages for Unordered Data Trees ∗
, 2012
"... We study highly expressive query languages for unordered data trees, using as formal vehicles Active XML and extensions of languages in the while family. All languages may be seen as adding some form of control on top of a set of basic pattern queries. The results highlight the impact and interplay ..."
Abstract
- Add to MetaCart
We study highly expressive query languages for unordered data trees, using as formal vehicles Active XML and extensions of languages in the while family. All languages may be seen as adding some form of control on top of a set of basic pattern queries. The results highlight the impact and interplay
Process Models for Design Synthesis
- AI Magazine
, 1990
"... The use of AI techniques in developing design programs provides formalisms for representing p r o b l e m -s o l v i n g processes. In this article, the use of AI techniques in modeling design processes is elaborated with the presentation of three models that formalize the representation of design ..."
Abstract
-
Cited by 32 (2 self)
- Add to MetaCart
process is not well supported by computer-based tools unless the design problem can be formulated in mathematical terms; for example, optimization techniques are used during synthesis when the design problem can be formulated as an objective function and constraints. The recent use of knowledgebased
DECLARE and SDS: Early Efforts to Commercialize Deductive Database Technology
- VLDB JOURNAL
, 1994
"... The Smart Data System (SDS) and its declarative query language, Declarative Reasoning, represent the first large-scale effort to commercialize deductive database technology. SDS offers the functionality of deductive reasoning in a distributed, heterogeneous database environment. In this article we d ..."
Abstract
- Add to MetaCart
The Smart Data System (SDS) and its declarative query language, Declarative Reasoning, represent the first large-scale effort to commercialize deductive database technology. SDS offers the functionality of deductive reasoning in a distributed, heterogeneous database environment. In this article we
Deductive Approach for Programming Sensor Networks
"... As sensor networks become common and enable new applications, developing powerful paradigms for programming sensor networks becomes critical to realize their full potential as collaborative data processing engines. In this article, we propose a deductive framework for programming sensor networks, ba ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
, based on the observation that the sensor network can be viewed as a distributed database of facts gathered from the environment. We believe that the overall collaborative (distributed) functionality of a sensor network application can be easily represented using deductive (logic) rules, and the non
Results 1 - 10
of
59
