標(biāo)題: Titlebook: Database Theory - ICDT‘99; 7th International Co Catriel Beeri,Peter Buneman Conference proceedings 1999 Springer-Verlag Berlin Heidelberg 1 [打印本頁(yè)] 作者: 劉興旺 時(shí)間: 2025-3-21 18:52
書目名稱Database Theory - ICDT‘99影響因子(影響力)
書目名稱Database Theory - ICDT‘99影響因子(影響力)學(xué)科排名
書目名稱Database Theory - ICDT‘99網(wǎng)絡(luò)公開度
書目名稱Database Theory - ICDT‘99網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Database Theory - ICDT‘99被引頻次
書目名稱Database Theory - ICDT‘99被引頻次學(xué)科排名
書目名稱Database Theory - ICDT‘99年度引用
書目名稱Database Theory - ICDT‘99年度引用學(xué)科排名
書目名稱Database Theory - ICDT‘99讀者反饋
書目名稱Database Theory - ICDT‘99讀者反饋學(xué)科排名
作者: 補(bǔ)角 時(shí)間: 2025-3-21 22:24
Urn Models and Yao’s Formulathat such situations can be modelized by probabilistic urn models. This allows us to fully characterize the distribution probability of the number of selected blocks under uniformity assumptions, and to consider extensions to non-uniform block probabilities. We also obtain a computationnally effcient approximation of Yao’s formula.作者: Pericarditis 時(shí)間: 2025-3-22 03:49 作者: Entropion 時(shí)間: 2025-3-22 07:03
Advances in Immigrant Family Researchnjunctive queries and embedded dependencies, as well as many interesting examples of complex value and oodb queries and integrity constraints. We show that some important classical results on containment, dependency implication, and chasing extend and generalize to this class.作者: cunning 時(shí)間: 2025-3-22 09:17
Eric A. Hurtado,Rodney A. Appellthat such situations can be modelized by probabilistic urn models. This allows us to fully characterize the distribution probability of the number of selected blocks under uniformity assumptions, and to consider extensions to non-uniform block probabilities. We also obtain a computationnally effcient approximation of Yao’s formula.作者: 表示向下 時(shí)間: 2025-3-22 16:27 作者: 表示向下 時(shí)間: 2025-3-22 17:47 作者: Rct393 時(shí)間: 2025-3-23 00:10 作者: CIS 時(shí)間: 2025-3-23 01:57 作者: Shuttle 時(shí)間: 2025-3-23 08:15 作者: DRILL 時(shí)間: 2025-3-23 13:00 作者: Genetics 時(shí)間: 2025-3-23 15:56 作者: 嬰兒 時(shí)間: 2025-3-23 18:30 作者: 用肘 時(shí)間: 2025-3-24 01:20 作者: 截?cái)?nbsp; 時(shí)間: 2025-3-24 06:22 作者: overshadow 時(shí)間: 2025-3-24 08:42
Pharmacotherapy of Urgency Incontinencefectiveness. In order to empirically evaluate these indexes, it is helpful to have methodologies for generating random queries for performance testing. In this paper we propose a domain-independent approach to the generation of random queries: choose randomly among all logically distinct queries. We作者: PON 時(shí)間: 2025-3-24 12:21 作者: Brochure 時(shí)間: 2025-3-24 18:53
,Robert Sprague’s “Adequate Defense”,ear conceptual framework in which to reason about transactional correctness in such an environment. This paper is a first attempt at developing such framework. Unlike most existing systems, where concurrent executions are controlled by a centralized scheduler, we will assume that each element in the作者: Ballerina 時(shí)間: 2025-3-24 20:41
Variation Séculaire des Longitudess of updating and querying such databases. Specifically, the update problem is to determine when the location of a moving object in the database (namely its database location) should be updated. We answer this question by proposing an information cost model that captures uncertainty, deviation, and 作者: 出生 時(shí)間: 2025-3-25 02:29 作者: insomnia 時(shí)間: 2025-3-25 05:03 作者: evanescent 時(shí)間: 2025-3-25 09:04
https://doi.org/10.1007/978-3-031-09334-0 and identically distributed dimensions), as dimensionality increases, the distance to the nearest data point approaches the distance to the farthest data point. To provide a practical perspective, we present empirical results on both real and synthetic data sets that demonstrate that this effect ca作者: fatuity 時(shí)間: 2025-3-25 14:31
Continental Philosophy of Psychiatryase applications, including histogram-based selectivity estimation, load-balancing, and construction of index structures. While provably optimal and efficient algorithms exist for partitioning one-dimensional data, the multi-dimensional problem has received less attention, except for a few special c作者: 閃光東本 時(shí)間: 2025-3-25 18:17 作者: 商議 時(shí)間: 2025-3-25 22:44 作者: 立即 時(shí)間: 2025-3-26 03:17
https://doi.org/10.1007/978-3-031-09334-0f semistructured data has been established. It is being realized, however, that having a common . is also necessary, to support tasks such as query formulation, decomposition and optimization, or declarative specification of data translation. In this paper we elaborate on the theoretical foundations作者: 高射炮 時(shí)間: 2025-3-26 07:20 作者: osteoclasts 時(shí)間: 2025-3-26 08:49
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/263457.jpg作者: yohimbine 時(shí)間: 2025-3-26 13:20 作者: Brain-Waves 時(shí)間: 2025-3-26 18:27
Frosso Motti-Stefanidi,Ann S. Mastennt logic. These results have some remarkable consequences concerning the definability of certain classes of graphs..Finally, we show that each database of tree-width at most . can be characterized up to isomorphism in the language C., the (. + 3)-variable fragment of firstorder logic with counting.作者: Missile 時(shí)間: 2025-3-26 23:22
Pharmacotherapy of Urgency Incontinencey of spatial properties. This raises questions about the quality of the workloads generated from such queries. We contrast our approach with previous work that generates workloads of random spatial ranges, and we sketch directions for future work on the robust generation of workloads for studying in作者: SNEER 時(shí)間: 2025-3-27 02:04
https://doi.org/10.1007/978-3-031-09334-0uctures, and provide a syntactic characterization of first-order orthographic dimension preserving queries..The main result of the paper concerns linear constraint databases. We prove that orthographic dimension preserving Boolean combination of conjunctive queries can be evaluated independently of 作者: 單調(diào)女 時(shí)間: 2025-3-27 08:32
https://doi.org/10.1007/978-3-031-09334-0ar, most such techniques proposed in the literature are not evaluated versus simple linear scan, and are evaluated over workloads for which nearest neighbor is not meaningful. Often, even the reported experiments, when analyzed carefully, show that linear scan would outperform the techniques being p作者: 意外的成功 時(shí)間: 2025-3-27 11:02
Continental Philosophy of Psychiatryre approximation algorithms for several partitioning problems that provably approximate the optimal solutions within small constant factors, and that run in linear or close to linear time. We also establish the NP-hardness of several partitioning problems, therefore it is unlikely that there are eff作者: 礦石 時(shí)間: 2025-3-27 16:17 作者: EXALT 時(shí)間: 2025-3-27 20:32
0302-9743 initiated in Dresden (1987), and continued in Visegrad (1989) and Rostock (1991). ICDT aims to enhance the exchange of ideas and cooperation in database research both within uni?ed Europe, and 978-3-540-65452-0978-3-540-49257-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: CHECK 時(shí)間: 2025-3-28 00:47 作者: PAC 時(shí)間: 2025-3-28 05:58
Definability and Descriptive Complexity on Databases of Bounded Tree-Widthnt logic. These results have some remarkable consequences concerning the definability of certain classes of graphs..Finally, we show that each database of tree-width at most . can be characterized up to isomorphism in the language C., the (. + 3)-variable fragment of firstorder logic with counting.作者: 小木槌 時(shí)間: 2025-3-28 07:21
On the Generation of 2-Dimensional Index Workloadsy of spatial properties. This raises questions about the quality of the workloads generated from such queries. We contrast our approach with previous work that generates workloads of random spatial ranges, and we sketch directions for future work on the robust generation of workloads for studying in作者: 脫毛 時(shí)間: 2025-3-28 10:28
On the Orthographic Dimension of Constraint Databasesuctures, and provide a syntactic characterization of first-order orthographic dimension preserving queries..The main result of the paper concerns linear constraint databases. We prove that orthographic dimension preserving Boolean combination of conjunctive queries can be evaluated independently of 作者: Ardent 時(shí)間: 2025-3-28 18:08
When Is “Nearest Neighbor” Meaningful?ar, most such techniques proposed in the literature are not evaluated versus simple linear scan, and are evaluated over workloads for which nearest neighbor is not meaningful. Often, even the reported experiments, when analyzed carefully, show that linear scan would outperform the techniques being p作者: negotiable 時(shí)間: 2025-3-28 20:56
On Rectangular Partitionings in Two Dimensions: Algorithms, Complexity and Applicationsre approximation algorithms for several partitioning problems that provably approximate the optimal solutions within small constant factors, and that run in linear or close to linear time. We also establish the NP-hardness of several partitioning problems, therefore it is unlikely that there are eff作者: 特征 時(shí)間: 2025-3-28 23:55 作者: Albumin 時(shí)間: 2025-3-29 04:39
Novel Computational Approaches to Information Retrieval and Data Miningh for interesting patterns in data— we argue that a meaningful definition of “interesting” requires consideration of the optimization problem the enterprise is facing. This “microeconomic” view leads quickly to certain novel and interesting computational problems.作者: hangdog 時(shí)間: 2025-3-29 08:36 作者: Carcinogen 時(shí)間: 2025-3-29 15:05 作者: invade 時(shí)間: 2025-3-29 17:31 作者: helper-T-cells 時(shí)間: 2025-3-29 22:06 作者: 發(fā)現(xiàn) 時(shí)間: 2025-3-30 01:01
Schemas for Integration and Translation of Structured and Semi-structured Data of a middle-ware schema model. We present expressive and flexible schema definition languages, and investigate properties such as expressive power and the complexity of decision problems that are significant in the context of data translation and integration.作者: 易改變 時(shí)間: 2025-3-30 05:39
Ardeshir R. Rastinehad,Gopal H. Badlaniate how extending this class leads to undecidability. In addition to new areas, our work also has relevance to extensions of results for related problems such as query containment, trigger termination, implication of dependencies and reasoning in description logics.作者: Intend 時(shí)間: 2025-3-30 12:07 作者: Latency 時(shí)間: 2025-3-30 15:17 作者: 讓空氣進(jìn)入 時(shí)間: 2025-3-30 17:06
Variation Séculaire des Longitudesation and the database location exceeds a given threshold, .. Dead-reckoning is the prevalent approach in military applications, and our cost model enables us to determine the threshold .. Then we consider the problem of processing range queries in the database, and we propose a probabilistic algorithm to solve the problem.作者: TEN 時(shí)間: 2025-3-30 22:38 作者: Abnormal 時(shí)間: 2025-3-31 03:14 作者: Tinea-Capitis 時(shí)間: 2025-3-31 05:38
https://doi.org/10.1007/978-3-031-09334-0ema may be too complex or changes too often. The term . data has been used to refer to such data. The semistructured data model consists of an edge-labeled graph, in which nodes correspond to objects and edges to attributes or values. Figure 1 illustrates a semistructured database providing information about a city.作者: ADOPT 時(shí)間: 2025-3-31 10:42 作者: 聯(lián)想記憶 時(shí)間: 2025-3-31 14:45
Increasing the Expressiveness of Analytical Performance Models for Replicated Databasesd communication). We derive a complete analytical queueing model for 2RC and demonstrate that it is of higher expressiveness than existing models. 2RC also yields a novel bottleneck analysis and permits to evaluate the trade-off between throughput and availability.作者: 不適當(dāng) 時(shí)間: 2025-3-31 17:43
Transactions in Stack, Fork, and Join Composite Systemsements in the system. In this paper we analyze basic configurations of such composite systems and develop correctness criteria for each case. Moreover, we also show how these ideas can be used to characterize and improve different transaction models such as distributed transactions, sagas, and federated database transactions.作者: 懶鬼才會(huì)衰弱 時(shí)間: 2025-4-1 01:18
