Sciweavers

200 search results - page 18 / 40
» Datalog Queries of Set Constraint Databases
Sort
View
ADBIS
2004
Springer
124views Database» more  ADBIS 2004»
15 years 2 months ago
Database Caching - Towards a Cost Model for Populating Cache Groups
Web caching keeps single Web objects ready somewhere in caches in the user-to-server path, whereas database caching uses fullfledged database management systems as caches to adapt...
Theo Härder, Andreas Bühmann
76
Voted
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
15 years 10 months ago
Topical query decomposition
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
Francesco Bonchi, Carlos Castillo, Debora Donato, ...
181
Voted
GIS
2006
ACM
15 years 10 months ago
Distance join queries on spatial networks
The result of a distance join operation on two sets of objects R, S on a spatial network G is a set P of object pairs <p, q>, p R, q S such that the distance of an object ...
Jagan Sankaranarayanan, Houman Alborzi, Hanan Same...
WEBI
2001
Springer
15 years 1 months ago
A Data Model for XML Databases
In the proposed data model for XML databases, an XML element is directly represented as a ground (variable-free) XML expression—a generalization of an XML element by incorporatio...
Vilas Wuwongse, Kiyoshi Akama, Chutiporn Anutariya...
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
15 years 2 months ago
Computing label-constraint reachability in graph databases
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yan...