標題: Titlebook: Database Theory - ICDT ‘95; 5th International Co Georg Gottlob,Moshe Y. Vardi Conference proceedings 1995 Springer-Verlag Berlin Heidelberg [打印本頁] 作者: gratuity 時間: 2025-3-21 18:55
書目名稱Database Theory - ICDT ‘95影響因子(影響力)
書目名稱Database Theory - ICDT ‘95影響因子(影響力)學(xué)科排名
書目名稱Database Theory - ICDT ‘95網(wǎng)絡(luò)公開度
書目名稱Database Theory - ICDT ‘95網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Database Theory - ICDT ‘95被引頻次
書目名稱Database Theory - ICDT ‘95被引頻次學(xué)科排名
書目名稱Database Theory - ICDT ‘95年度引用
書目名稱Database Theory - ICDT ‘95年度引用學(xué)科排名
書目名稱Database Theory - ICDT ‘95讀者反饋
書目名稱Database Theory - ICDT ‘95讀者反饋學(xué)科排名
作者: 癡呆 時間: 2025-3-21 23:24 作者: moratorium 時間: 2025-3-22 03:07
Avelino J. Gonzalez,Patrick Brézillonced one(s). Those transactions embody active rule semantics which can be either immediate or deferred. Rule semantics, confluence, equivalence and optimization are then formally investigated and characterized in a solid framework that naturally extends a known setting for relational database transactions.作者: CHANT 時間: 2025-3-22 05:55 作者: REIGN 時間: 2025-3-22 09:04 作者: harmony 時間: 2025-3-22 14:10 作者: harmony 時間: 2025-3-22 17:02 作者: 種族被根除 時間: 2025-3-22 23:05 作者: 蓋他為秘密 時間: 2025-3-23 03:28 作者: Fatten 時間: 2025-3-23 08:32
Natasa Milic-Frayling,Rachel Jonesexamples of complete query languages with external functions. A byproduct of the equivalence result is the fact that Relational Machines are complete for complex objects: it was known that they are not complete over flat relations.作者: AUGUR 時間: 2025-3-23 13:37 作者: Encumber 時間: 2025-3-23 14:11
Jeanne E Parker,Debra L Hollister also isolate a syntactic condition that guarantees the existence of a unique stable model for a program. This condition, in its turn, is inspired by the local stratification condition of perfect model semantics for programs with negation. Finally we define a bottom-up procedure that computes the unique stable model of a stratified program.作者: Emg827 時間: 2025-3-23 20:38 作者: Wordlist 時間: 2025-3-24 01:06 作者: Bernstein-test 時間: 2025-3-24 03:15 作者: Expediency 時間: 2025-3-24 08:00
Conference proceedings 1995ll invited papers and the abstracts of two tutorials, the book includes the revised full versions of 29 technical contributions selected from a total of 116 submissions. The papers address all current aspects of database theory; they are organized in sections on optimization, nonmonotonic semantics,作者: blight 時間: 2025-3-24 11:31
DATALOG queries with stratified negation and choice: from , to ,,,neral algorithm that ensures efficient execution for the different complexity classes. We thus obtain a class of DATALOG programs that preserves computational tractability, while achieving completeness for a wide range of complexity classes.作者: Soliloquy 時間: 2025-3-24 18:50
Unified transaction model for semantically rich operations,asses of prefix reducible schedules and argue that serializability and atomicity can be unified by considering schedules from these classes. We also show that the previously proposed correctness criteria [MGG86a, MGG86b] and [RKS92, RKS93] are subsumed by our model.作者: 方便 時間: 2025-3-24 20:07 作者: BAIL 時間: 2025-3-25 02:54 作者: Noctambulant 時間: 2025-3-25 04:40 作者: Generator 時間: 2025-3-25 11:18 作者: Morbid 時間: 2025-3-25 13:35 作者: 委屈 時間: 2025-3-25 17:24 作者: 神化怪物 時間: 2025-3-25 20:45 作者: 補角 時間: 2025-3-26 03:42 作者: BATE 時間: 2025-3-26 06:05
Distributed query optimization in loosely coupled multidatabase systems,ion process is organized as a sequence of steps, in which at each step all . work in parallel to evaluate the cost of execution plans for partial queries of increasing size, and send their cost estimates to the other . that need them for the next step. The computation is totally distributed, and org作者: Vital-Signs 時間: 2025-3-26 08:29
On the complexity of generating optimal left-deep processing trees with cross products,marizing the intermediate result sizes has the ASI property. It further motivates us to restrict the subsequent investigations to this cost function called .. for which we show that the problem remains NP-complete in the general case..Then, we concentrate on the main topic of the paper: the complexi作者: Venules 時間: 2025-3-26 15:04
Querying disjunctive databases through nonmonotonic logics, autoepistemic logic and some of their fragments express the same class of Boolean queries, which turns out to be a strict subclass of the ..-recognizable Boolean queries. Then we prove that under the assumption that the database consists of clauses whose length is bound by some constant, default lo作者: maroon 時間: 2025-3-26 19:14 作者: 從屬 時間: 2025-3-26 22:37
On two forms of structural recursion,lent . query requires exponential space. Thus, as a mechanism for implementing . over complex objects, . is strictly less powerful than .. This inefficiency is in contrast to a previous result that uniformly translates efficient . programs into efficient . programs, but over a language with higher-o作者: circuit 時間: 2025-3-27 02:41 作者: 極肥胖 時間: 2025-3-27 08:35
,Languages for polynomial-time queries — An ongoing quest,作者: hypertension 時間: 2025-3-27 11:28 作者: 攀登 時間: 2025-3-27 17:37
Distributed query optimization in loosely coupled multidatabase systems,l applications accessing data at more than one .. An important research issue in . is query optimization. The query optimization problem in . is quite different from the case of distributed database system (.) since, due to schema heterogeneity and local autonomy of component ., is not possible to a作者: 虛弱的神經(jīng) 時間: 2025-3-27 19:16 作者: LASH 時間: 2025-3-28 00:54 作者: Visual-Field 時間: 2025-3-28 05:28
DATALOG queries with stratified negation and choice: from , to ,,,ution is based on (i) stratified negation as the core of a simple, declarative semantics for negation, (ii) the use of a “choice” construct to capture non-determinism of stable models (iii) the ability to bind a query execution to the complexity class that includes the problem at hand, and (iv) a ge作者: 假裝是你 時間: 2025-3-28 08:05
On the Kolmogorov expressive power of boolean query languages,lean queries), and gives a meaningful definition of the expressive power of a query language in a single finite model..The notion of . of a boolean query language . in a finite model A is defined by considering two values: the Kolmogorov complexity of the isomorphism type of A, equal to the length o作者: 陳列 時間: 2025-3-28 13:46 作者: 嘴唇可修剪 時間: 2025-3-28 14:51
-Languages for sets and sub-PTIME graph transformers,sponding finite set operations (data base queries) may be realized in NLOGSPACE under representation of sets by extensional well-founded (acyclic) graphs. (In a previous work for another version of .-language an exact correspondence to PTIME-computability was established.) Moreover, each of the ment作者: Myocarditis 時間: 2025-3-28 18:45 作者: 聽覺 時間: 2025-3-29 01:04
Unified transaction model for semantically rich operations,ive correctness criteria that encompass both serializability and failure atomicity in a uniform manner. As it turns out, an exact characterization of the class of prefix reducible schedules that was introduced for the simple read/write model in [AVA+94] is infeasible. Thus, we propose here two subcl作者: calamity 時間: 2025-3-29 03:28
The Dynamic Two Phase Commitment (D2PC) protocol,n invested in optimizing its performance. The . (D2PC) protocol is an enhancement of the common (static) . (T2PC) protocols. Unlike T2PC, with D2PC the commit coordinator is dynamically determined by racing READY (YES vote) messages, on a per transaction basis, rather than being fixed, predetermined作者: CORD 時間: 2025-3-29 08:00 作者: Frequency-Range 時間: 2025-3-29 13:52
An algebra for pomsets,tatype. We introduce an algebra for ., which generalizes traditional algebras for (nested) sets, bags and lists. This paper is motivated by the study of the impact of different language primitives on the expressive power. We show that the use of partially ordered types increases the expressive power作者: BROTH 時間: 2025-3-29 19:25 作者: 單純 時間: 2025-3-29 21:35 作者: START 時間: 2025-3-30 02:24
A rewriting technique for the analysis and the optimization of active databases,d transaction, which is viewed here as a sequence of atomic database updates forming a semantic unit, is translated by means of active rules into induced one(s). Those transactions embody active rule semantics which can be either immediate or deferred. Rule semantics, confluence, equivalence and opt作者: FEAT 時間: 2025-3-30 07:36 作者: 煤渣 時間: 2025-3-30 10:55 作者: 同時發(fā)生 時間: 2025-3-30 14:06 作者: 性學(xué)院 時間: 2025-3-30 18:17 作者: PLE 時間: 2025-3-30 21:52
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/263453.jpg作者: 用樹皮 時間: 2025-3-31 04:23 作者: 懶鬼才會衰弱 時間: 2025-3-31 05:20 作者: 閑聊 時間: 2025-3-31 10:06 作者: Complement 時間: 2025-3-31 15:22 作者: morale 時間: 2025-3-31 18:51
Samuel Lemercier,Daniel Thalmannution is based on (i) stratified negation as the core of a simple, declarative semantics for negation, (ii) the use of a “choice” construct to capture non-determinism of stable models (iii) the ability to bind a query execution to the complexity class that includes the problem at hand, and (iv) a ge作者: 不再流行 時間: 2025-4-1 00:53 作者: chalice 時間: 2025-4-1 05:41
Order Effects within Personality Measuresprocessing of data. The second one is called . and it corresponds to data-parallel processing. A uniform first-order translation from . into . was known from previous work. The converse translation is by necessity more difficult and we have obtained three main results concerning it. First, we exhibi作者: COMMA 時間: 2025-4-1 06:50
https://doi.org/10.1007/978-1-4612-2848-6sponding finite set operations (data base queries) may be realized in NLOGSPACE under representation of sets by extensional well-founded (acyclic) graphs. (In a previous work for another version of .-language an exact correspondence to PTIME-computability was established.) Moreover, each of the ment作者: 油膏 時間: 2025-4-1 11:22 作者: 四指套 時間: 2025-4-1 17:25
Context and Connection in Metaphorive correctness criteria that encompass both serializability and failure atomicity in a uniform manner. As it turns out, an exact characterization of the class of prefix reducible schedules that was introduced for the simple read/write model in [AVA+94] is infeasible. Thus, we propose here two subcl作者: 沖擊力 時間: 2025-4-1 20:03
Natasa Milic-Frayling,Rachel Jonesn invested in optimizing its performance. The . (D2PC) protocol is an enhancement of the common (static) . (T2PC) protocols. Unlike T2PC, with D2PC the commit coordinator is dynamically determined by racing READY (YES vote) messages, on a per transaction basis, rather than being fixed, predetermined作者: 打擊 時間: 2025-4-1 22:44 作者: hemorrhage 時間: 2025-4-2 05:56
Natasa Milic-Frayling,Rachel Jonestatype. We introduce an algebra for ., which generalizes traditional algebras for (nested) sets, bags and lists. This paper is motivated by the study of the impact of different language primitives on the expressive power. We show that the use of partially ordered types increases the expressive power作者: 取消 時間: 2025-4-2 07:41
Web 2.0 and Network Intelligence chosen semantics for value invention is based on Skolem functor terms. We show that, in presence of value invention, the whole expressive power is achieved using programs made of two strata, and that ILOG. (i.e., the class of programs with non-equality and without negation) express the downward mon
