Filters








10,172 Hits in 8.0 sec

Bounding the cardinality of aggregate views through domain-derived constraints

Paolo Ciaccia, Matteo Golfarelli, Stefano Rizzi
2003 Data & Knowledge Engineering  
This paper proposes an approach based on cardinality constraints, derived a-priori from the application domain, which may bound either the cardinality of a view or the ratio between the cardinalities of  ...  Accurately estimating the cardinality of aggregate views is crucial for logical and physical design of data warehouses.  ...  Conclusions and open issues In this paper we have shown how cardinality constraints derived from the application domain may be employed to determine effective bounds on the cardinality of aggregate views  ... 
doi:10.1016/s0169-023x(02)00177-5 fatcat:bvfqaopdcbgfzdxmqj2s7thj6q

On Estimating the Cardinality of Aggregate Views

Paolo Ciaccia, Matteo Golfarelli, Stefano Rizzi
2001 Design and Management of Data Warehouses  
Bounds are determined by using, besides the functional dependencies expressed by the multidimensional scheme, additional domain-derived information in the form of cardinality constraints which may bound  ...  This paper proposes an approach to estimate the cardinality of views based on a-priori information derived from the application domain.  ...  of aggregate views and how, in turn, such bounds can be used to estimate the cardinality of the views.  ... 
dblp:conf/dmdw/CiacciaGR01 fatcat:3a2dp66r5jafbfurcbgskefyji

The Enhanced Entity-Relationship Model [chapter]

Bernhard Thalheim
2011 Handbook of Conceptual Modeling  
However, most applications require analysis of data, integration or federation of data, advanced aggregation of data, and advanced basic data types.  ...  Each language used should be based on a clear definition of structure, semantics, operations, behavior and environment. At the same time, languages presuppose implicit assumptions and constraints.  ...  The domain constraint Cardinality constraints are the most important class of constraints of the EER model. We distinguish two main kinds of cardinality constraints.  ... 
doi:10.1007/978-3-642-15865-0_6 fatcat:2qqwrexbxfhmza3veue55zm35a

Mechanising shared configuration and diagnosis theories through constraint logic programming

Nirad Sharma, Robert Colomb
1998 The Journal of Logic Programming  
A common problem is that problem-solvers typically encode task-speci®c representation assumptions and simpli®cations in their domain theories, hindering the reuse of the domain theories between the problem-solvers  ...  A component speci®cation language is presented and the mappings from the language to the constraint system and strategies for guiding the search are de®ned for the respective problem-solvers.  ...  Acknowledgements The work reported in this paper has been funded in part by the Cooperative Research Centres Programme through the Department of the Prime Minister and Cabinet of the Commonwealth Government  ... 
doi:10.1016/s0743-1066(98)10010-9 fatcat:zypsf77k7fcyhckjsb5wafoj2e

Cardinality-based inference control in OLAP systems

Nan Zhang, Wei Zhao, Jianer Chen
2004 Proceedings of the 7th ACM international workshop on Data warehousing and OLAP - DOLAP '04  
The goal of inference controls is to prevent exact values of sensitive data from being inferred through answers to online analytical processing (OLAP) queries.  ...  We address the inference control problem in data cubes with some data known to users through external knowledge.  ...  An upper bound on the cardinality of cells known by users through external knowledge is derived to make data cubes inference-free. Our work is preliminary and many extensions can be made.  ... 
doi:10.1145/1031763.1031776 dblp:conf/dolap/ZhangZC04 fatcat:b5ldtqon2je4lbccgjidfdxxrq

FeaturePlugin

Michal Antkiewicz, Krzysztof Czarnecki
2004 Proceedings of the 2004 OOPSLA workshop on eclipse technology eXchange - eclipse '04  
The tool supports cardinality-based feature modeling, specialization of feature diagrams, and configuration based on feature diagrams.  ...  Feature modeling is a key technique used in product-line development to model commonalities and variabilities of productline members.  ...  Observe that the cardinality of Method has * as upper bound, which means that Method can be cloned an unbounded number of times.  ... 
doi:10.1145/1066129.1066143 dblp:conf/eclipse/AntkiewiczC04 fatcat:zct3iiwyvrc2rfz4z7s5yctrwe

Improving the Performance of OLAP Queries Using Families of Statistics Trees [chapter]

Joachim Hammer, Lixin Fu
2001 Lecture Notes in Computer Science  
Our approach is based on our previous version of CubiST (Cubing with Statistics Trees), which pre-computes and stores all possible aggregate views in the leaves of a statistics tree during a one-time scan  ...  Our new version remedies this limitation by materializing a family of derived trees from the single statistics tree.  ...  The amount of memory that is needed to store a k-dimensional statistics tree is bounded by c(d 1 +1)(d 2 +1)…(d k +1), where d i is the cardinality of dimension i, and the constant value c accounts for  ... 
doi:10.1007/3-540-44801-2_27 fatcat:6x3famcilzg25aseal3xvuhsnq

Design and Implementation of Aggregate Functions in the DLV System [article]

Wolfgang Faber, Gerald Pfeifer, Nicola Leone, Tina Dell'Armi, Giuseppe Ielpa
2008 arXiv   pre-print
Furthermore, we analyze the computational complexity of DLP^A, showing that the addition of aggregates does not bring a higher cost in that respect.  ...  In particular, we avoid the introduction of constructs with disputed semantics, by requiring aggregates to be stratified.  ...  Wolfgang Faber's work was funded by an APART grant of the Austrian Academy of Sciences.  ... 
arXiv:0802.3137v1 fatcat:a4p7orlwdrbnvjmpjiqxooso24

Foundations of aggregation constraints

Kenneth A. Ross, Divesh Srivastava, Peter J. Stuckey, S. Sudarshan
1998 Theoretical Computer Science  
We describe a complete and minimal axiomatization of aggregation constraints, for the SQL aggregate functions min, max, sum, count and average, over a non-empty, finite multiset on several domains.  ...  We discuss the relationships between aggregation constraints over a non-empty, finite multiset of reals, and constraints on the elements of the multiset.  ...  If the employee relation is a derived view relation, these constraints may be computed using the integrity constraints on the database relations and the definition of the employee relation (see [7] ,  ... 
doi:10.1016/s0304-3975(97)00011-x fatcat:cuuqjqsjbbcdjmpsebfgymfgti

CYADB

Zechao Shang, Will Brackenbury, Aaron J. Elmore, Michael J. Franklin
2018 Proceedings of the VLDB Endowment  
CYADB is a human-in-the-loop system, in which the data owner utilizes his or her domain knowledge of data to specify aspects of the missing data, such as where it might be missing ("where"), how many data  ...  Additionally, CYADB provides concrete examples of missing data that match the missing sensitivity to help the user interactively refine the provided domain knowledge. PVLDB Reference Format:  ...  For example, for cardinality constraint (R, Ri, C), we manage a histogram of table R on attribute Ri to record which attributes have values that have already hit the upper bound of cardinality constraint  ... 
doi:10.14778/3229863.3236254 fatcat:pkbf3vi24jhpxi5gevyd2c2wjy

Reverse engineering of relational database applications [chapter]

Mark W. W. Vermeer, Peter M. G. Apers
1995 Lecture Notes in Computer Science  
The target of such an effort is the definition of a fully equipped object-oriented view of the relational database, including methods and constraints.  ...  Such views can be seen as a full specification of the database semantics, aiding for example in the identification of semantic heterogeneity among interoperable databases.  ...  The derivation of such a view has received considerable attention in literature. However, current work (e.g.  ... 
doi:10.1007/bfb0020523 fatcat:3t2yz76sqjbi7g4giadgkaneta

Systematic Review of Cerebral Palsy Registries/Surveillance Groups: Relationships between Registry Characteristics and Knowledge Dissemination

Donna S Hurley Theresa Sukal
2015 International Journal of Physical Medicine & Rehabilitation  
Current address: IBM Almaden Research Center, San Jose, CA 95120, USA -asimits@us.ibm.com. maxOccurs are provided to restrict the cardinality of an element.  ...  elements, and (c) labels denote the min and max cardinality allowed for an element.  ...  This work is co-funded by the European Social Fund (75%) and National Resources (25%) -Operational Program for Educational and Vocational Training II (EPEAEK II) and particularly the Program PYTHAGORAS  ... 
doi:10.4172/2329-9096.1000266 pmid:27790626 pmcid:PMC5079705 fatcat:huq7ga7rbngotpgdwanvnhzqei

Ontology-Based Conceptual Design of ETL Processes for Both Structured and Semi-Structured Data

Dimitrios Skoutas, Alkis Simitsis
2007 International Journal on Semantic Web and Information Systems (IJSWIS)  
Current address: IBM Almaden Research Center, San Jose, CA 95120, USA -asimits@us.ibm.com. maxOccurs are provided to restrict the cardinality of an element.  ...  elements, and (c) labels denote the min and max cardinality allowed for an element.  ...  This work is co-funded by the European Social Fund (75%) and National Resources (25%) -Operational Program for Educational and Vocational Training II (EPEAEK II) and particularly the Program PYTHAGORAS  ... 
doi:10.4018/jswis.2007100101 fatcat:nxu2tt6adrav7bpaarl4r7d2fe

Aggregate Query Answering on Possibilistic Data with Cardinality Constraints

Graham Cormode, Divesh Srivastava, Entong Shen, Ting Yu
2012 2012 IEEE 28th International Conference on Data Engineering  
of cardinality constraints.  ...  An important case which arises in many real applications is when the data describes a set of possibilities, but with cardinality constraints.  ...  The goal of query answering is then to find the expected value of an aggregate, or tail bounds on its value.  ... 
doi:10.1109/icde.2012.15 dblp:conf/icde/CormodeSSY12 fatcat:zeg6j4v6yvb3lm52vksqlfy4gu

Extended Entity-Relationship Model [chapter]

Bernhard Thalheim
2017 Encyclopedia of Database Systems  
Cardinality constraints [1, 3, 4, 6, 9] are the most important generalisation of relational database constraints [8].  ...  Typical integrity constraints of the extended entity-relationship model are participation, look-across, and general cardinality constraints.  ...  The most important class of integrity constraints of the EER model is the class of cardinality constraints.  ... 
doi:10.1007/978-1-4899-7993-3_157-2 fatcat:z6jcxsdet5b4dnv6h256ynfzvq
« Previous Showing results 1 — 15 out of 10,172 results