Güzel, Elem

Profile Picture
Profile URL
https://hdl.handle.net/20.500.14365/7391
Name Variants
Kalayci, Elem Guzel
Kalayci, E.
Güzel Kalayci, Elem
Kalaycı, E. Güzel
Job Title
Email Address
elem.guzel@ieu.edu.tr
Main Affiliation
05.05. Computer Engineering
Status
Former Staff
Website
ORCID ID
https://orcid.org/0000-0001-9916-8062
Scopus Author ID
55834615500
Turkish CoHE Profile ID
Google Scholar ID
WYEhpZYAAAAJ
WoS Researcher ID
CWC-2170-2022

Sustainable Development Goals

SDG data is not available
Documents

22

Citations

453

h-index

11

Go to Scopus profile
Documents

1

Citations

7

Go to WoS profile
Scholarly Output

1

Articles

0

Views / Downloads

0/0

Supervised MSc Theses

0

Supervised PhD Theses

0

WoS Citation Count

0

Scopus Citation Count

0

WoS h-index

0

Scopus h-index

0

Patents

0

Projects

0

WoS Citations per Publication

0.00

Scopus Citations per Publication

0.00

Open Access Source

0

Supervised Theses

0

JournalCount
Mendel1
Current Page: 1 / 1

Scopus Quartile Distribution

Competency Cloud

GCRIS Competency Cloud

Filters

20121
Reset filters

Settings

Scholarly Output Search Results

Now showing 1 - 1 of 1
  • Thumbnail Image
    Conference Object
    Reordering Triple Patterns of Sparql Queries Using Ant Colony Optimization
    (Brno University of Technology, 2012) Kalayci E.G.; Kalayci T.E.
    Semantic web is a paradigm that is proposed for configuring and controlling the overwhelming volumes of information on the web. One important challenge in semantic web is decreasing execution times of queries. Reordering triple patterns is an approach for decreasing execution times of queries. In this study, an ant colony optimization approach for optimizing SPARQL queries by reordering triple patterns is proposed. Contributions of this approach are optimizing order of triple patterns in SPARQL queries using ant colony optimization for lesser execution time and real time optimization without requiring any prior domain knowledge. This proposed novel method is implemented using ARQ query engine and it optimizes the queries for in-memory models of ontologies. Experiments show that proposed method reduces execution time considerably.