Data exchange is the process of converting an instance of one schema into an instance of a different schema according to a given specification. Recent data exchange systems have l...
A Reverse k-Nearest-Neighbor (RkNN) query finds the objects that take the query object as one of their k nearest neighbors. In this paper we propose new solutions for evaluating R...
Integrity constraints, a.k.a. data dependencies, are being widely used for improving the quality of schema. Recently constraints have enjoyed a revival for improving the quality o...
Keyword search in XML repositories is a powerful tool for interactive data exploration. Much work has recently been done on making XML search aware of relationship information emb...
Andrey Balmin, Latha S. Colby, Emiran Curtmola, Qu...
Modern Internet communities need to integrate and query structured information. Employing current information integration infrastructure, data integration is still a very costly e...
Queries, or calls to stored procedures/user-defined functions are often invoked multiple times, either from within a loop in an application program, or from the where/select claus...
Ad-hoc data processing has proven to be a critical paradigm for Internet companies processing large volumes of unstructured data. However, the emergence of cloud-based computing, ...
Keyword search on graph structured data has attracted a lot of attention in recent years. Graphs are a natural "lowest common denominator" representation which can combi...
Bhavana Bharat Dalvi, Meghana Kshirsagar, S. Sudar...
Schema mappings are fundamental building blocks in many information integration applications. Designing mappings is a timeconsuming process and for that reason many mapping system...