標(biāo)題: Titlebook: Database Theory – ICDT 2007; 11th International C Thomas Schwentick,Dan Suciu Conference proceedings 2006 Springer-Verlag Berlin Heidelberg [打印本頁(yè)] 作者: 自由 時(shí)間: 2025-3-21 19:05
書目名稱Database Theory – ICDT 2007影響因子(影響力)
書目名稱Database Theory – ICDT 2007影響因子(影響力)學(xué)科排名
書目名稱Database Theory – ICDT 2007網(wǎng)絡(luò)公開(kāi)度
書目名稱Database Theory – ICDT 2007網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書目名稱Database Theory – ICDT 2007被引頻次
書目名稱Database Theory – ICDT 2007被引頻次學(xué)科排名
書目名稱Database Theory – ICDT 2007年度引用
書目名稱Database Theory – ICDT 2007年度引用學(xué)科排名
書目名稱Database Theory – ICDT 2007讀者反饋
書目名稱Database Theory – ICDT 2007讀者反饋學(xué)科排名
作者: Albumin 時(shí)間: 2025-3-21 22:12
978-3-540-69269-0Springer-Verlag Berlin Heidelberg 2006作者: Mendicant 時(shí)間: 2025-3-22 03:33
Database Theory – ICDT 2007978-3-540-69270-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 大都市 時(shí)間: 2025-3-22 07:44
0302-9743 Overview: 978-3-540-69269-0978-3-540-69270-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Incompetent 時(shí)間: 2025-3-22 12:02
https://doi.org/10.1007/978-3-319-28074-5 statistics about a population while preserving the privacy of individuals. This new perspective has been invaluable in guiding the development of a powerful approach to private data analysis, founded on precise mathematical definitions, and yielding algorithms with provable, meaningful, privacy guarantees.作者: GAVEL 時(shí)間: 2025-3-22 15:18 作者: GAVEL 時(shí)間: 2025-3-22 17:16 作者: 審問(wèn) 時(shí)間: 2025-3-22 21:29
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/263451.jpg作者: AVID 時(shí)間: 2025-3-23 01:38 作者: DEMN 時(shí)間: 2025-3-23 07:07
Consistent Query Answering: Five Easy PiecesConsistent query answering (CQA) is an approach to querying inconsistent databases without repairing them first. This invited talk introduces the basics of CQA, and discusses selected issues in this area. The talk concludes with a summary of other relevant work and an outline of potential future research topics.作者: angiography 時(shí)間: 2025-3-23 11:37 作者: 注意到 時(shí)間: 2025-3-23 16:15 作者: GLUT 時(shí)間: 2025-3-23 20:14
Health Visiting in Anxious Timesing. It provides a natural framework for consistency and safety questions, which first considers approximate solutions and then exact solutions obtained with a Corrector..We consider a model based on transducers of words and trees, and study .-Consistency, i.e., the problem of deciding whether a giv作者: mastopexy 時(shí)間: 2025-3-24 01:41 作者: 狂熱文化 時(shí)間: 2025-3-24 03:20 作者: 利用 時(shí)間: 2025-3-24 08:04
Marie Louise Seeberg,El?bieta M. Go?dziakource-to-target dependencies which express inclusion of unions of conjunctive queries with equality. This generalizes previous privacy work in the global-as-view publishing scenario and covers local-as-view as well as combinations of the two..We concentrate on . security, where malicious users have 作者: 昏暗 時(shí)間: 2025-3-24 12:42
Helene Bang Appel,Rashmi Singlaal, and the axiomatisation proposed for XML keys is incomplete even if key paths are simple. Therefore, the axiomatisation and also the implication problem for XML keys are still unsolved..We propose a set of inference rules that is indeed sound and complete for the implication of XML keys with simp作者: largesse 時(shí)間: 2025-3-24 16:59
https://doi.org/10.1007/978-3-319-44610-3ument normalization, and data integrity. XFDs are more complicated than relational functional dependencies because the set of XFDs satisfied by an XML document depends not only on the document values, but also the tree structure and corresponding DTD. In particular, constraints imposed by DTDs may a作者: Encephalitis 時(shí)間: 2025-3-24 19:35 作者: Cervical-Spine 時(shí)間: 2025-3-25 02:14
https://doi.org/10.1007/978-3-531-92371-0re fixed and.> 1 (.> arity – 1 for structures of higher arity). We consider conjunctive properties over these random graphs, and investigate the problem of computing their asymptotic conditional probabilities. This provides us a novel approach to dealing with uncertainty in databases, with applicati作者: averse 時(shí)間: 2025-3-25 06:12
https://doi.org/10.1007/978-3-531-92371-0ons with safe negation or inequality, which correspond to well-known classes of relational algebra queries. We provide a set of decidability, undecidability and complexity results for answering queries of the above languages over various classes of Description Logics knowledge bases. In general, suc作者: 性別 時(shí)間: 2025-3-25 10:06
https://doi.org/10.1057/9781403982858nswers to a query that are consistent wrt .. Consistent answers are invariant under all the . of ., i.e. the consistent instances that minimally depart from .. Three classes of repair have been considered in the literature: those that minimize set-theoretically the set of tuples in the symmetric dif作者: Complement 時(shí)間: 2025-3-25 14:21 作者: arthroscopy 時(shí)間: 2025-3-25 17:54 作者: 兇殘 時(shí)間: 2025-3-25 23:38
https://doi.org/10.1057/9781403982858 beads for trajectory samples. We study transformations for which important physical properties of trajectories, such as speed, are invariant. We also determine which transformations preserve beads. We give conceptually easy first-order complete query languages and computationally complete query lan作者: FLOUR 時(shí)間: 2025-3-26 03:36 作者: curettage 時(shí)間: 2025-3-26 04:44
Contested Transparencies: An Introduction,pe checking problem for smtts. While the problem is decidable, the involved technique of inverse type inference is known to have exponential worst-case complexity (already for top-down transformations without parameters). We present a new . type checking algorithm based on forward type inference thr作者: pineal-gland 時(shí)間: 2025-3-26 08:41
Contested Transparencies: An Introduction,e, inclusion, and non-emptiness of intersection of schemas form the basic building blocks for schema optimization and integration, and algorithms for static analysis of transformations. It is thereby paramount to establish the exact complexity of these problems. Most common schema languages for XML 作者: 善于 時(shí)間: 2025-3-26 15:32
Ask a Better Question, Get a Better Answer A New Approach to Private Data Analysis statistics about a population while preserving the privacy of individuals. This new perspective has been invaluable in guiding the development of a powerful approach to private data analysis, founded on precise mathematical definitions, and yielding algorithms with provable, meaningful, privacy guarantees.作者: 頑固 時(shí)間: 2025-3-26 17:17 作者: harmony 時(shí)間: 2025-3-27 00:01
Query Evaluation on a Database Given by a Random Graphre fixed and.> 1 (.> arity – 1 for structures of higher arity). We consider conjunctive properties over these random graphs, and investigate the problem of computing their asymptotic conditional probabilities. This provides us a novel approach to dealing with uncertainty in databases, with applications to data privacy and other database problems.作者: conifer 時(shí)間: 2025-3-27 03:10 作者: Favorable 時(shí)間: 2025-3-27 07:10
Privacy in GLAV Information Integration unauthorized access to the data..We define both absolute guarantees: how safe is the secret? and relative guarantees: how much of the secret is additionally disclosed when the mapping is extended, for example to allow new data sources or new relationships between an existing data source and the glo作者: 向宇宙 時(shí)間: 2025-3-27 10:52 作者: 執(zhí)拗 時(shí)間: 2025-3-27 13:53 作者: 真實(shí)的人 時(shí)間: 2025-3-27 20:06
Optimizing Schema Languages for XML: Numerical Constraints and Interleavingthe basic decision problems. We present a complete overview of the complexity of the basic decision problems for DTDs, XSDs and Relax NG with regular expressions incorporating numerical occurrence constraints and interleaving. We also discuss chain regular expressions and the complexity of the schem作者: 紅潤(rùn) 時(shí)間: 2025-3-28 00:24 作者: DAMP 時(shí)間: 2025-3-28 02:59 作者: Anticonvulsants 時(shí)間: 2025-3-28 06:15
https://doi.org/10.1007/978-3-531-92371-0al to undecidability of query answering, even in DLs of very limited expressiveness. We also highlight the negative consequences of these results for the integration of ontologies and rules. We believe that these results have important implications for ontology-based information access, in particula作者: zonules 時(shí)間: 2025-3-28 12:44 作者: opportune 時(shí)間: 2025-3-28 17:32 作者: Mechanics 時(shí)間: 2025-3-28 19:34 作者: LAVE 時(shí)間: 2025-3-29 01:15 作者: 疲勞 時(shí)間: 2025-3-29 03:12 作者: faucet 時(shí)間: 2025-3-29 08:58 作者: 開(kāi)花期女 時(shí)間: 2025-3-29 14:31
https://doi.org/10.1057/9781403982858 determine which transformations preserve beads. We give conceptually easy first-order complete query languages and computationally complete query languages for trajectory databases, which allow to talk directly about speed and beads. The queries expressible in these languages are invariant under speed- and bead-preserving transformations.作者: Trigger-Point 時(shí)間: 2025-3-29 17:08 作者: membrane 時(shí)間: 2025-3-29 23:18 作者: 晚來(lái)的提名 時(shí)間: 2025-3-30 00:41 作者: ILEUM 時(shí)間: 2025-3-30 04:39
Contested Bodies of Childhood and Youtht conjunctive queries – in fact, no monotonic language is sufficiently powerful. We also exhibit several well-behaved classes of conjunctive views and queries for which conjunctive rewritings remain sufficient. This continues a previous investigation of rewriting and its connection to semantic determinacy, for various query and view languages.作者: 圓柱 時(shí)間: 2025-3-30 10:28
https://doi.org/10.1007/978-3-319-44610-3and DTDs. We present a sound and complete axiomatization for XFDs, both alone and in the presence of certain classes of DTDs; we show that these DTD classes induce an axiomatic hierarchy. We also give efficient implication algorithms for those classes of DTDs that do not use disjunction or nesting.作者: ASTER 時(shí)間: 2025-3-30 16:19
https://doi.org/10.1057/9781403982858 show that several important problems are efficiently solvable on WSDs while they are NP-hard on c-tables. Finally, we give a polynomial-time algorithm for factorizing WSDs, i.e. an efficient algorithm for minimizing such representations.作者: 收養(yǎng) 時(shí)間: 2025-3-30 18:14 作者: 截?cái)?nbsp; 時(shí)間: 2025-3-30 20:52 作者: DECRY 時(shí)間: 2025-3-31 04:23 作者: interpose 時(shí)間: 2025-3-31 06:10
Approximate Data Exchangeester, i.e. can be solved by looking at a constant fraction of the input .. We also show that .-Typechecking on words can be solved in polynomial time, whereas the exact problem is PSPACE-complete. Moreover, data exchange settings can be composed when they are close.作者: 憤慨一下 時(shí)間: 2025-3-31 10:40 作者: 冷淡一切 時(shí)間: 2025-3-31 14:47
Characterization of the Interaction of XML Functional Dependencies with DTDsand DTDs. We present a sound and complete axiomatization for XFDs, both alone and in the presence of certain classes of DTDs; we show that these DTD classes induce an axiomatic hierarchy. We also give efficient implication algorithms for those classes of DTDs that do not use disjunction or nesting.作者: defile 時(shí)間: 2025-3-31 18:58
World-Set Decompositions: Expressiveness and Efficient Algorithms show that several important problems are efficiently solvable on WSDs while they are NP-hard on c-tables. Finally, we give a polynomial-time algorithm for factorizing WSDs, i.e. an efficient algorithm for minimizing such representations.作者: B-cell 時(shí)間: 2025-4-1 01:15 作者: 提升 時(shí)間: 2025-4-1 03:12
Exact XML Type Checking in Polynomial Timefied by a deterministic automaton, the algorithm is . whenever the transducer uses only few parameters and visits every input node only constantly often. Our new approach can also be generalized from smtts to stay macro forest transducers which additionally support concatenation as built-in output operation.作者: Foreknowledge 時(shí)間: 2025-4-1 09:34
Ask a Better Question, Get a Better Answer A New Approach to Private Data Analysis statistics about a population while preserving the privacy of individuals. This new perspective has been invaluable in guiding the development of a powerful approach to private data analysis, founded on precise mathematical definitions, and yielding algorithms with provable, meaningful, privacy gua作者: neuron 時(shí)間: 2025-4-1 11:46
Beauty and the Beast: The Theory and Practice of Information Integration of information are proliferating. This paper briefly reviews some of the key research accomplishments in information integration (theory and systems), then describes the current state-of-the-art in commercial practice, and the challenges (still) faced by CIOs and application developers. One critica作者: macular-edema 時(shí)間: 2025-4-1 14:47
Approximate Data Exchangeing. It provides a natural framework for consistency and safety questions, which first considers approximate solutions and then exact solutions obtained with a Corrector..We consider a model based on transducers of words and trees, and study .-Consistency, i.e., the problem of deciding whether a giv
