1263 search results - page 79 / 253 » A Scalable Algorithm for Answering Queries Using Views |
201
click to vote
ICDE
2001
IEEE
16 years 3 months ago
2001
IEEE
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
138
Voted
ICDE
2007
IEEE
15 years 9 months ago
2007
IEEE
Retrieval queries that combine structural constraints with keyword search represent a significant challenge to XML data management systems. Queries are expected to be answered as...
111
Voted
WWW
2004
ACM
16 years 3 months ago
2004
ACM
In peer-to-peer networks, finding the appropriate answer for an information request, such as the answer to a query for RDF(S) data, depends on selecting the right peer in the netw...
103
Voted
ADBIS
2001
Springer
15 years 6 months ago
2001
Springer
In this paper, the most appropriate buffer structure, page replacement policy and buffering scheme for closest pairs queries, where both spatial datasets are stored in R-trees, are...
157
Voted
IPPS
1999
IEEE
15 years 6 months ago
1999
IEEE
Multidimensional Analysis and On-Line Analytical Processing (OLAP) uses summary information that requires aggregate operations along one or more dimensions of numerical data value...