000			04110nam a22005775i 4500
001			978-3-540-36285-2
003			DE-He213
005			20160624101934.0
007			cr nn 008mamaa
008			121227s2003 gw | s |||| 0|eng d
020			_a9783540362852 _9978-3-540-36285-2
024	7		_a10.1007/3-540-36285-1 _2doi
050		4	_aQA76.9.D3
072		7	_aUN _2bicssc
072		7	_aUMT _2bicssc
072		7	_aCOM021000 _2bisacsh
082	0	4	_a005.74 _223
245	1	0	_aDatabase Theory — ICDT 2003 _h[electronic resource] : _b9th International Conference Siena, Italy, January 8–10, 2003 Proceedings / _cedited by Diego Calvanese, Maurizio Lenzerini, Rajeev Motwani.
260		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2003.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2003.
300			_aXII, 460 p. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aLecture Notes in Computer Science, _x0302-9743 ; _v2572
505	0		_aInvited Papers -- Open Problems in Data-Sharing Peer-to-Peer Systems -- Approximations in Database Systems -- Bioinformatics Adventures in Database Research -- Reasoning about XML Schemas and Queries -- Incremental Validation of XML Documents -- Typechecking Top-Down Uniform Unranked Tree Transducers -- Structural Properties of XPath Fragments -- On Reasoning about Structural Equality in XML: A Description Logic Approach -- Aggregate Queries -- Containment of Aggregate Queries -- Auditing Sum Queries -- CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries -- Optimal Range Max Datacube for Fixed Dimensions -- Query Evaluation -- Processing XML Streams with Deterministic Automata -- Deciding Termination of Query Evaluation in Transitive-Closure Logics for Constraint Databases -- Query Rewriting and Reformulation -- Data Exchange: Semantics and Query Answering -- Reformulation of XML Queries and Constraints -- New Rewritings and Optimizations for Regular Path Queries -- Database Interrogation Using Conjunctive Queries -- Semistructured versus Structured Data -- On the Difficulty of Finding Optimal Relational Decompositions for XML Workloads: A Complexity Theoretic Perspective -- Generating Relations from XML Documents -- Query Containment -- Containment for XPath Fragments under DTD Constraints -- XPath Containment in the Presence of Disjunction, DTDs, and Variables -- Decidable Containment of Recursive Queries -- Containment of Conjunctive Queries with Safe Negation -- Consistency and Incompleteness -- Probabilistic Interval XML -- Condensed Representation of Database Repairs for Consistent Query Answering -- Typing Graph-Manipulation Operations -- Characterizing the Temporal and Semantic Coherency of Broadcast-Based Data Dissemination -- Data Structures -- An Efficient Indexing Scheme for Multi-dimensional Moving Objects -- Nearest Neighbors Can Be Found Efficiently If the Dimension Is Small Relative to the Input Size.
650		0	_aComputer science.
650		0	_aDatabase management.
650		0	_aInformation storage and retrieval systems.
650		0	_aInformation systems.
650		0	_aManagement information systems.
650	1	4	_aComputer Science.
650	2	4	_aDatabase Management.
650	2	4	_aComputation by Abstract Devices.
650	2	4	_aMathematical Logic and Formal Languages.
650	2	4	_aInformation Storage and Retrieval.
650	2	4	_aInformation Systems Applications (incl.Internet).
650	2	4	_aBusiness Information Systems.
700	1		_aCalvanese, Diego. _eeditor.
700	1		_aLenzerini, Maurizio. _eeditor.
700	1		_aMotwani, Rajeev. _eeditor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783540003236
786			_dSpringer
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v2572
856	4	0	_uhttp://dx.doi.org/10.1007/3-540-36285-1
942			_2EBK4263 _cEBK
999			_c33557 _d33557