Sciweavers

505 search results - page 12 / 101
» Queries with Incomplete Answers over Semistructured Data
Sort
View
ICDE
2002
IEEE
206views Database» more  ICDE 2002»
15 years 11 months ago
Exploiting Local Similarity for Indexing Paths in Graph-Structured Data
XML and other semi-structured data may have partially specified or missing schema information, motivating the use of a structural summary which can be automatically computed from ...
Raghav Kaushik, Pradeep Shenoy, Philip Bohannon, E...
ASP
2003
Springer
15 years 2 months ago
Mappings Between Domain Models in Answer Set Programming
Integration of data is required when accessing multiple databases within an organization or on the WWW. Schema integration is required for database interoperability, but it is curr...
Stefania Costantini, Andrea Formisano, Eugenio G. ...
SIGMOD
2006
ACM
123views Database» more  SIGMOD 2006»
15 years 9 months ago
Exploiting predicate-window semantics over data streams
The continuous sliding-window query model is used widely in data stream management systems where the focus of a continuous query is limited to a set of the most recent tuples. In ...
Thanaa M. Ghanem, Walid G. Aref, Ahmed K. Elmagarm...
VLDB
2000
ACM
129views Database» more  VLDB 2000»
15 years 1 months ago
Offering a Precision-Performance Tradeoff for Aggregation Queries over Replicated Data
Strict consistency of replicated data is infeasible or not required by many distributed applications, so current systems often permit stale replication, in which cached copies of ...
Chris Olston, Jennifer Widom
ICDE
2004
IEEE
148views Database» more  ICDE 2004»
15 years 11 months ago
Approximate Selection Queries over Imprecise Data
We examine the problem of evaluating selection queries over imprecisely represented objects. Such objects are used either because they are much smaller in size than the precise on...
Iosif Lazaridis, Sharad Mehrotra