Sciweavers

2514 search results - page 20 / 503
» On the Computation of Approximations of Database Queries
Sort
View
ICDE
2002
IEEE
206views Database» more  ICDE 2002»
16 years 7 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...
PODS
2004
ACM
98views Database» more  PODS 2004»
16 years 6 months ago
Processing First-Order Queries under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. Given a first-order query Q, the problem is to decide whether there is an equivalent query whi...
Alan Nash, Bertram Ludäscher
IDEAS
2007
IEEE
146views Database» more  IDEAS 2007»
16 years 14 days ago
Approximate Structural Matching over Ordered XML Documents
There is an increasing need for an XML query engine that not only searches for exact matches to a query but also returns “query-like” structures. We have designed and develope...
Nitin Agarwal, Magdiel Galan Oliveras, Yi Chen
DEXA
2008
Springer
132views Database» more  DEXA 2008»
15 years 8 months ago
Efficient Updates for Continuous Skyline Computations
We address the problem of maintaining continuous skyline queries efficiently over dynamic objects with d dimensions. Skyline queries are an important new search capability for mult...
Yu-Ling Hsueh, Roger Zimmermann, Wei-Shinn Ku
DEXAW
2007
IEEE
142views Database» more  DEXAW 2007»
15 years 8 months ago
Synopsis Data Structures for XML Databases: Models, Issues, and Research Perspectives
Due to the lack of efficient native XML database management systems, XML data manipulation and query evaluation may be resource-consuming, and represent a bottleneck for several ...
Angela Bonifati, Alfredo Cuzzocrea