標(biāo)題: Titlebook: Database Theory - ICDT 2003; 9th International Co Diego Calvanese,Maurizio Lenzerini,Rajeev Motwani Conference proceedings 2003 Springer-Ve [打印本頁] 作者: 熱愛 時(shí)間: 2025-3-21 17:21
書目名稱Database Theory - ICDT 2003影響因子(影響力)
書目名稱Database Theory - ICDT 2003影響因子(影響力)學(xué)科排名
書目名稱Database Theory - ICDT 2003網(wǎng)絡(luò)公開度
書目名稱Database Theory - ICDT 2003網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Database Theory - ICDT 2003被引頻次
書目名稱Database Theory - ICDT 2003被引頻次學(xué)科排名
書目名稱Database Theory - ICDT 2003年度引用
書目名稱Database Theory - ICDT 2003年度引用學(xué)科排名
書目名稱Database Theory - ICDT 2003讀者反饋
書目名稱Database Theory - ICDT 2003讀者反饋學(xué)科排名
作者: 場(chǎng)所 時(shí)間: 2025-3-22 00:05 作者: 暗指 時(shí)間: 2025-3-22 02:44 作者: Adenocarcinoma 時(shí)間: 2025-3-22 05:12
Generating Relations from XML Documentsatisfy the path expressions and are related to one another in a meaningful fashion. Different semantics for evaluation are given that take into account the possible presence of incomplete information. The complexity of generating relations from documents is analyzed and evaluation algorithms are described.作者: CAMEO 時(shí)間: 2025-3-22 12:11
https://doi.org/10.1007/978-3-319-44998-2tions for research in P2P systems, and highlight problems that have not yet been studied in great depth. We focus on two particular aspects of P2P systems—. —and suggest several open and important research problems for the community to address.作者: noxious 時(shí)間: 2025-3-22 16:03
3D Thinking: A Different Orientation to Timehe most important data approximation problems and attempt to put them in a common framework and identify their similarities and differences. We then hint on some open and challenging problems that we believe are worth investigating.作者: noxious 時(shí)間: 2025-3-22 20:01
Contextual Process Digitalizatione of the document and m the number of updates. For specialized DTDs, we provide an .(m log. n) incremental algorithm, again using an auxiliary structure of size .. This is a significant improvement over brute-force re-validation from scratch.作者: 俗艷 時(shí)間: 2025-3-22 22:51 作者: EXPEL 時(shí)間: 2025-3-23 01:58 作者: Clumsy 時(shí)間: 2025-3-23 06:27
https://doi.org/10.1007/978-981-4560-55-9sly known methods. We develop an algorithm for computing MPR’s and prove, through a complexity theoretic analysis, that our algorithm is essentially optimal. Also, we present query answering algorithms that utilize exact partial rewritings for regular path queries and conjunctive regular path queries respectively.作者: galley 時(shí)間: 2025-3-23 11:55 作者: GUISE 時(shí)間: 2025-3-23 14:07 作者: machination 時(shí)間: 2025-3-23 19:41 作者: 弄臟 時(shí)間: 2025-3-23 22:34
Contextualism, Factivity and Closurehe presence of integrity constraints, containment can be reduced to equivalence. For conjunctive . and .-queries, simpler characterizations for containment are given, that do not require checking equivalence. These results are built upon in order to solve the problem of finding maximally-contained sets of rewritings for conjunctive .-queries.作者: Iatrogenic 時(shí)間: 2025-3-24 04:54 作者: 誰在削木頭 時(shí)間: 2025-3-24 07:23
https://doi.org/10.1007/978-3-319-94926-0atisfy the path expressions and are related to one another in a meaningful fashion. Different semantics for evaluation are given that take into account the possible presence of incomplete information. The complexity of generating relations from documents is analyzed and evaluation algorithms are described.作者: 沒有準(zhǔn)備 時(shí)間: 2025-3-24 14:40 作者: Mutter 時(shí)間: 2025-3-24 18:22
Approximations in Database Systemshe most important data approximation problems and attempt to put them in a common framework and identify their similarities and differences. We then hint on some open and challenging problems that we believe are worth investigating.作者: Sciatica 時(shí)間: 2025-3-24 19:11 作者: 污點(diǎn) 時(shí)間: 2025-3-25 00:33 作者: 違反 時(shí)間: 2025-3-25 04:16 作者: pulse-pressure 時(shí)間: 2025-3-25 10:55 作者: Ondines-curse 時(shí)間: 2025-3-25 15:37 作者: 偶然 時(shí)間: 2025-3-25 19:05
https://doi.org/10.1007/978-981-4560-55-9or which termination of query evaluation is decidable and which is more expressive than first-order logic over the reals. Furthermore, we can define a guarded fragment in which exactly the terminating queries of this language are expressible.作者: 一大群 時(shí)間: 2025-3-25 22:57
Processing XML Streams with Deterministic Automatand when it is constructed lazily. Our analysis indicates that, when the automaton is constructed lazily, and under certain assumptions about the structure of the input XML data, the number of states in the lazy DFA is manageable. We also validate experimentally our findings, on both synthetic and real XML data sets.作者: Conquest 時(shí)間: 2025-3-26 03:02 作者: manifestation 時(shí)間: 2025-3-26 04:56 作者: 擴(kuò)音器 時(shí)間: 2025-3-26 11:03
Data Exchange: Semantics and Query Answerings to compute a canonical universal solution efficiently.We adopt the notion of “certain answers” in indefinite databases for the semantics for query answering in data exchange. We investigate the computational complexity of computing the certain answers in this context and also study the problem of 作者: Morose 時(shí)間: 2025-3-26 13:23
On the Difficulty of Finding Optimal Relational Decompositions for XML Workloads: A Complexity Theor Our results suggest that, contrary to the trend in previous work, the eventual development of practical algorithms for finding relational decompositions for XML workloads will require judicious choices of cost models and translation algorithms, rather than an exclusive focus on the decomposition pr作者: MITE 時(shí)間: 2025-3-26 20:20
Eugene Dairianathan,Chee-Hoo Lumo compute the aggregate of the weights of those input rectangles that overlap with the query rectangle. This result immediately improves a recent result on temporal-aggregate queries. Our indexing scheme can be dynamized and extended to higher dimensions. Finally, we demonstrate the practical effici作者: metropolitan 時(shí)間: 2025-3-26 22:16 作者: DEMUR 時(shí)間: 2025-3-27 01:33 作者: 蕁麻 時(shí)間: 2025-3-27 05:29 作者: bifurcate 時(shí)間: 2025-3-27 12:09 作者: ALE 時(shí)間: 2025-3-27 15:42
Bioinformatics Adventures in Database Research biology in the post-genome era.We discuss here data integration and datamining in bioinformatics, as well as the role that database theory played in these topics. We also describe LIMS as a third key topic in bioinformatics where advances in database system and theory can be very relevant.作者: indubitable 時(shí)間: 2025-3-27 19:41 作者: rectocele 時(shí)間: 2025-3-27 22:36
Typechecking Top-Down Uniform Unranked Tree Transducersts satisfying a given input schema. As typechecking quickly turns undecidable for query languages capable of testing equality of data values, we return to the limited framework where we abstract XML documents as labeled ordered trees. We focus on simple top-down recursive transformations motivated b作者: BILL 時(shí)間: 2025-3-28 04:27 作者: cloture 時(shí)間: 2025-3-28 06:59
On Reasoning about Structural Equality in XML: A Description Logic Approachn the presence of document type definitions. This application depends on the novel ability of .. to express functional dependencies over sets of possibly infinite feature paths defined by regular languages. We also present a decision procedure for the associated logical implication problem. The proc作者: Nefarious 時(shí)間: 2025-3-28 11:38 作者: vitrectomy 時(shí)間: 2025-3-28 16:28
Auditing Sum Queries data. To check that, every sum query and previously answered sum queries should be audited. We show that, under a suitable query-overlap restriction, an auditing procedure can be efficiently worked out using flownetwork computation.作者: metropolitan 時(shí)間: 2025-3-28 19:04
CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queriesllows: Given a set of weighted points in R., compute the aggregate of weights of points that lie inside a .-dimensional query rectangle. In this paper we focus on range-COUNT, SUM, AVG aggregates. First, we develop an indexing scheme for answering two-dimensional range-COUNT queries that uses. disk 作者: accessory 時(shí)間: 2025-3-29 02:07
Optimal Range Max Datacube for Fixed Dimensionse . ≤ .. log log ./ log(log* .), our structure requires .(...) query time and .((..n).) storage where .., .. and .. are constants independent of . and .; and log* . is the minimum number of repeated logarithms it takes to reduce the value . to at most 2. Hence our data structure is asymptotically op作者: Libido 時(shí)間: 2025-3-29 04:50 作者: 偽書 時(shí)間: 2025-3-29 10:24 作者: 放氣 時(shí)間: 2025-3-29 15:22 作者: 沒花的是打擾 時(shí)間: 2025-3-29 16:58 作者: Clinch 時(shí)間: 2025-3-29 20:35 作者: 可行 時(shí)間: 2025-3-30 00:46 作者: dendrites 時(shí)間: 2025-3-30 07:14 作者: GRAIN 時(shí)間: 2025-3-30 08:45
Generating Relations from XML Documentsan index indicating which path expressions may not be assigned the null value. Evaluating a relation generator involves finding tuples of nodes that satisfy the path expressions and are related to one another in a meaningful fashion. Different semantics for evaluation are given that take into accoun作者: APNEA 時(shí)間: 2025-3-30 13:14
https://doi.org/10.1007/3-540-36285-1Data Engineering; Database Design; Database Logic; Database Systems; Database Theory; Extensible Markup L作者: gruelling 時(shí)間: 2025-3-30 17:40 作者: gentle 時(shí)間: 2025-3-30 22:51 作者: 詳細(xì)目錄 時(shí)間: 2025-3-31 01:09
0302-9743 Overview: Includes supplementary material: 978-3-540-00323-6978-3-540-36285-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: glacial 時(shí)間: 2025-3-31 06:37 作者: Overdose 時(shí)間: 2025-3-31 11:10
Contextualized Practices in Arts Education data. To check that, every sum query and previously answered sum queries should be audited. We show that, under a suitable query-overlap restriction, an auditing procedure can be efficiently worked out using flownetwork computation.作者: 教唆 時(shí)間: 2025-3-31 15:04
Contextualized Practices in Arts Educationive queries. We investigate to what extent features such as quantification, negation, or non-equalities are important in such a setting. We also investigate the difference between a setting where the client can pose an adaptive sequence of queries, and a setting where the client must pose a fixed combination of queries.作者: AMEND 時(shí)間: 2025-3-31 17:43 作者: intellect 時(shí)間: 2025-3-31 21:56 作者: 截?cái)?nbsp; 時(shí)間: 2025-4-1 05:15
https://doi.org/10.1007/978-3-319-44998-2s that would normally require large costly servers. The scale of these systems, their “open nature,” and the lack of centralized control pose difficult performance and security challenges. Much research has recently focused on tackling some of these challenges; in this paper, we propose future direc
