Browsing CE Theses and Dissertations by Author "Ramanan, Prakash"

Now showing items 1-5 of 5

    • Best effort query answering for mediators with union views 

      Papri, Rowshon Jahan (Wichita State University, 2011-07)
      Consider an SQL query that involves joins of several relations, optionally followed by selections and/or projections. It can be represented by a conjunctive datalog query Q without negation or arithmetic subgoals. We ...

    • Computing ranked selection indexes for linear preference queries 

      Francis, Preeti (Wichita State University, 2015-12)
      The significant increase in data storage and its consumption in today's world brings the focus on efficient query processing. It is general practice to query several data sources for k data entities based on a ranking of ...

    • Mapreduce implementation of Strassen's algorithm for matrix multiplication 

      Deng, Minhao (Wichita State University, 2017-05)
      Consider the multiplication C = A x B of two n x n matrices. A straight-forward sequential algorithm for computing the product takes ?(n 3 ) time. Strassen [17] presented an algorithm that takes ?(n lg 7) time; lg ...

    • Ranked selection indexes for linear preference queries 

      Singh, Sanjaya (Wichita State University, 2011-12)
      Data entities from various data sources could be ordered according to a variety of attributes associated with those entities. These orderings result in a ranking of entities in terms of the values in the attribute domains. ...

    • Tight bounds on one-pass map-reduce algorithms for matrix multiplication 

      Nagar, Ashita (Wichita State University, 2015-12)
      MapReduce is an effi t parallel computation model introduced by Google, for performing many large-scale computations, including matrix multiplication. Matrix multiplication can be done using either an one-pass or a two-pass ...