552 search results - page 64 / 111 » Efficient Algorithms for Processing XPath Queries |
HPDC
2010
IEEE
15 years 27 days ago
2010
IEEE
This paper proposes a cache hierarchy that enables Web search engines to efficiently process user queries. The different caches in the hierarchy are used to store pieces of data w...
163
click to vote
SIGMOD
2007
ACM
15 years 12 months ago
2007
ACM
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
126
click to vote
DOLAP
1999
ACM
15 years 4 months ago
1999
ACM
In this paper, we describe the design of a data warehousing system for an engineering company ‘R’. This system aims to assist users in retrieving data for business analysis in...
208
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
Reverse nearest neighbor (RNN) queries have a broad application base such as decision support, profile-based marketing, resource allocation, data mining, etc. Previous work on RNN ...
196
click to vote
SIGMOD
2009
ACM
16 years 1 days ago
2009
ACM
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...