A fundamental problem related to graph structured databases is searching for substructures. One issue with respect to optimizing such searches is the ability to estimate the freque...
Angela Maduko, Kemafor Anyanwu, Amit P. Sheth, Pau...
Multi-relational data mining has become popular due to the limitations of propositional problem definition in structured domains and the tendency of storing data in relational dat...
Yusuf Kavurucu, Pinar Senkul, Ismail Hakki Toroslu
Opening up large amounts of loosely structured information for easy access and use is a complex problem. This paper describes two systems that address different aspects of the pro...
Abstract New algorithms are constantly developed in search of better or faster results. Many variants of code are often tried while searching for the best solution. When the number...
The large unstructured text collections demand full-text search capabilities from IR systems. Current systems typically allow users only to connect to a single database (or site) ...