Browsing by Author "Cambazoglu, B. B."
Now showing items 1-19 of 19
-
Adaptive decomposition and remapping algorithms for object-space-parallel direct volume rendering of unstructured grids
(Academic Press, 2007-01)Object space (OS) parallelization of an efficient direct volume rendering algorithm for unstructured grids on distributed-memory architectures is investigated. The adaptive OS decomposition problem is modeled as a graph ... -
Architecture of a grid-enabled Web search engine
(Elsevier Ltd, 2007)Search Engine for South-East Europe (SE4SEE) is a socio-cultural search engine running on the grid infrastructure. It offers a personalized, on-demand, country-specific, category-based Web search facility. The main goal ... -
Cache-based query processing for search engines
(Association for Computing Machinery, 2012-11-01)In practice, a search engine may fail to serve a query due to various reasons such as hardware/network failures, excessive query load, lack of matching documents, or service contract limitations (e.g., the query rate limits ... -
Chat mining: predicting user and message attributes in computer-mediated communication
(Elsevier Ltd, 2008-07)The focus of this paper is to investigate the possibility of predicting several user and message attributes in text-based, real-time, online messaging services. For this purpose, a large collection of chat messages is ... -
Clustering spatial networks for aggregate query processing: a hypergraph approach
(Elsevier Ltd, 2008-03)In spatial networks, clustering adjacent data to disk pages is highly likely to reduce the number of disk page accesses made by the aggregate network operations during query processing. For this purpose, different techniques ... -
Data-parallel web crawling models
(Springer, 2004)The need to quickly locate, gather, and store the vast amount of material in the Web necessitates parallel computing. In this paper, we propose two models, based on multi-constraint graph-partitioning, for efficient ... -
Document replication strategies for geographically distributed web search engines
(Elsevier Ltd., 2013)Large-scale web search engines are composed of multiple data centers that are geographically distant to each other. Typically, a user query is processed in a data center that is geographically close to the origin of the ... -
Energy-price-driven query processing in multi-center web search engines
(IEEE, 2011-07)Concurrently processing thousands of web queries, each with a response time under a fraction of a second, necessitates maintaining and operating massive data centers. For large-scale web search engines, this translates ... -
A five-level static cache architecture for web search engines
(Elsevier Ltd, 2012)Caching is a crucial performance component of large-scale web search engines, as it greatly helps reducing average query response times and query processing workloads on backend search clusters. In this paper, we describe ... -
Hypergraph-partitioning-based remapping models for image-space-parallel direct volume rendering of unstructured grids
(Institute of Electrical and Electronics Engineers, 2007-07)In this work, image-space-parallel direct volume rendering (DVR) of unstructured grids is investigated for distributed-memory architectures. A hypergraph-partitioning-based model is proposed for the adaptive screen ... -
Image-space-parallel direct volume rendering on a cluster of PCs
(Springer, 2003)An image-space-parallel, ray-casting-based direct volume rendering algorithm is developed for rendering of unstructured data grids on distributed-memory parallel architectures. For efficiency in screen workload calculations, ... -
Improving the performance of independent task assignment heuristics Minmin, Maxmin and Sufferage
(Institute of Electrical and Electronics Engineers, 2014)MinMin, MaxMin, and Sufferage are constructive heuristics that are widely and successfully used in assigning independent tasks to processors in heterogeneous computing systems. All three heuristics are known to run in O(K ... -
A link-based storage scheme for efficient aggregate query processing on clustered road networks
(Elsevier Ltd, 2010)The need to have efficient storage schemes for spatial networks is apparent when the volume of query processing in some road networks (e.g., the navigation systems) is considered. Specifically, under the assumption that ... -
A machine learning approach for result caching in web search engines
(Elsevier, 2017)A commonly used technique for improving search engine performance is result caching. In result caching, precomputed results (e.g., URLs and snippets of best matching pages) of certain queries are stored in a fast-access ... -
Multi-level direct K-way hypergraph partitioning with multiple constraints and fixed vertices
(Academic Press, 2008-05)K-way hypergraph partitioning has an ever-growing use in parallelization of scientific computing applications. We claim that hypergraph partitioning with multiple constraints and fixed vertices should be implemented using ... -
Performance of query processing implementations in ranking-based text retrieval systems using inverted indices
(Elsevier Ltd, 2006-07)Similarity calculations and document ranking form the computationally expensive parts of query processing in ranking-based text retrieval. In this work, for these calculations, 11 alternative implementation techniques are ... -
Second chance: a hybrid approach for dynamic result caching and prefetching in search engines
(Association for Computing Machinery, 2013-12)Web search engines are known to cache the results of previously issued queries. The stored results typically contain the document summaries and some data that is used to construct the final search result page returned to ... -
Site-based partitioning and repartitioning techniques for parallel pagerank computation
(Institute of Electrical and Electronics Engineers, 2011-05)The PageRank algorithm is an important component in effective web search. At the core of this algorithm are repeated sparse matrix-vector multiplications where the involved web matrices grow in parallel with the growth of ... -
A term-based inverted index partitioning model for efficient distributed query processing
(Association for Computing Machinery, 2013)In a shared-nothing, distributed text retrieval system, queries are processed over an inverted index that is partitioned among a number of index servers. In practice, the index is either document-based or term-based ...
