The contribution of IR-tree suggested in this paper is that it achieves a reduction of overall query processing time and energy consumption compared with the traditional approaches by decreasing the number of queries by adopting spatio-temporal query aggregation.
Functions of IR-tree are categorized into three parts: index creation, query dissemination/reception, and index update.
One of the major query searches is to determine the relationships between nodes.
Besides, when querying the XML document, it is also necessary to translate a query into an SQL statement, and execute join operations repeatedly among different relation tables, so that it exposes lower efficiency.
This proposes top-k query processing and malicious node identification methods against DRAs and FNA attack in MANETs.
so as to reduce the computation the query message are not encrypted.
where C(p) represents a set of query
completions that match the typed prefix p and f(q) is the past popularity of query
q in the search log Q.
Only when we have stored ancestor nodes to check for discrete data, query
to send the ancestors, or when the query
routing table is not suitable to the neighbor node can send a query
to the other side of a tall tree, the query
sent to their parent node.
A novel query
expansion technique based on users' aspect and
In , a querying region transformation technique is proposed to fuzzy the target region of the query
according to predefined transformation functions.
Most readers when hearing the term query
think of the ubiquitous search box, and some may think about more ways for users to interact with the system, such as selecting further search criteria through filters or using an interface for fielded search.
The search query
for this particular item is "cc:me" or "bcc:me."