Sciweavers

8953 search results - page 33 / 1791
» Parallel Query Processing
Sort
View
IPPS
2007
IEEE
14 years 1 months ago
Optimized Inverted List Assignment in Distributed Search Engine Architectures
We study efficient query processing in distributed web search engines with global index organization. The main performance bottleneck in this case is due to the large amount of i...
Jiangong Zhang, Torsten Suel
DEXA
2004
Springer
140views Database» more  DEXA 2004»
14 years 1 months ago
Declustering of Trajectories for Indexing of Moving Objects Databases
Efficient storage and retrieval of trajectory indexes has become an essential requirement for moving objects databases. The existing 3DR-tree is known to be an effective trajectory...
Youngduk Seo, Bonghee Hong
ADBIS
2004
Springer
133views Database» more  ADBIS 2004»
14 years 1 months ago
Evaluation of the Mine-Merge Method for Data Mining Query Processing
In this paper we consider concurrent execution of multiple data mining queries in the context of discovery of frequent itemsets. If such data mining queries operate on similar part...
Marek Wojciechowski, Maciej Zakrzewicz
ICDE
2007
IEEE
120views Database» more  ICDE 2007»
14 years 1 months ago
Optimizing State-Intensive Non-Blocking Queries Using Run-time Adaptation
Main memory is a critical resource when processing non-blocking queries with state intensive operators that require real-time responses. While partitioned parallel processing can ...
Bin Liu, Mariana Jbantova, Elke A. Rundensteiner
ICDCS
2010
IEEE
13 years 11 months ago
Quantifying and Querying Network Reachability
—Quantifying and querying network reachability is important for security monitoring and auditing as well as many aspects of network management such as troubleshooting, maintenanc...
Amir R. Khakpour, Alex X. Liu