Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 11 of 11 for “"Query routing"”.

  1. An agent system for query routing search

    … of scalable agent-based systems which use query routing for resource or service discovery. Query routing is a type of informed distributed search in which agents reason about the capabilities of other agents in order to constrain the scope of a query and the cost of processing it.</p> …

    soton Download PDF for An agent system for query routing search (opens in a new tab)

  2. Query routing in cooperative semi-structured peer-to-peer information retrieval networks

    … which documents are relevant to a given user query. As a result, these search engines suffer from several technical drawbacks such as handling scale, timeliness and reliability, in addition to ethical concerns such as commercial manipulation and information censorship. Alleviating the need to …

    glasgow Download PDF for Query routing in cooperative semi-structured peer-to-peer information retrieval networks (opens in a new tab)

  3. Organizing and searching data in unstructured P2P networks

    … of techniques for efficient searching and query processing in unstructured P2P systems. SONs have been proposed in the relevant research literature, as a way to organize peers into thematic groups, thereby enabling query routing to specific peer groups in a deliberate way, instead of blind …

    greece Repository record for Organizing and searching data in unstructured P2P networks (opens in a new tab)

  4. Implications of query caching for JXTA peers

    … nodes between the data-source peer and the querying peer in super-peer P2P network. A precise algorithm was devised that demonstrated how queries can be deconstructed to provide greater flexibility for reusing their constituent elements. It showed how subsequent queries can make use of more …

    aston Download PDF for Implications of query caching for JXTA peers (opens in a new tab)

  5. Automated Multiparty Authorization in Open Distributed Systems

    … distributed proof construction, we propose query routing rules to allow each peer to customize its proof search behavior based on knowledge about where to get a certain credential. Configured with different query routing rules, PeerAccess is able to emulate the runtime behaviors of other …

    uiuc Repository record for Automated Multiparty Authorization in Open Distributed Systems (opens in a new tab)

  6. Towards efficient machine learning management systems

    … level, we identify two important sub-tasks: bulk query processing and streaming query processing, where query objects are either provided all at once as a bulk, or they stream in. As to bulk query processing, we study the Fixed-Radius Near Neighbour query and develop approximate algorithms to …

    ubc Repository record for Towards efficient machine learning management systems (opens in a new tab) Download PDF for Towards efficient machine learning management systems (opens in a new tab)

  7. Cost Analysis of Query-Anonymity on the Internet of Things

    … privacy issues that are not yet addressed. The query-anonymity arises when the client wants the destination physical sensor-node to be indistinguishable from other potential destinations. In particular, we consider the k-anonymous query scheme in which the query destination is indistinguishable …

    waterloo Repository record for Cost Analysis of Query-Anonymity on the Internet of Things (opens in a new tab)

  8. MementoMap: A Web Archive Profiling Framework for Efficient Memento Routing

    … their immense holdings as well as to support routing of requests in Memento aggregators. A memento is a past version of a web page and a Memento aggregator is a tool or service that aggregates mementos from many different web archives. To save resources, the Memento aggregator should only poll …

    odu Repository record for MementoMap: A Web Archive Profiling Framework for Efficient Memento Routing (opens in a new tab)

  9. Φιλτράρισμα και εξόρυξη δεδομένων σε αντικείμενα πληροφορίας

    … and distributed Bloom Filters for more efficient query routing.- A clustering algorithm focused on software quality evaluation metrics to assist system analysts in the early detection and resolution of source code quality issues.- Efficient data mining algorithms for web usage data utilizing …

    greece Repository record for Φιλτράρισμα και εξόρυξη δεδομένων σε αντικείμενα πληροφορίας (opens in a new tab)

  10. A semantic approach for scalable and self-organized context-aware systems

    In this thesis, we investigate and study on a set of core infrastructure services to simplify the task of building reliable and scalable context-aware applications in pervasive computing environments. Particularly, we focus on two problems: Providing a scalable and robust context lookup service in …

    nus Repository record for A semantic approach for scalable and self-organized context-aware systems (opens in a new tab) Download file for A semantic approach for scalable and self-organized context-aware systems (opens in a new tab)

  11. Overcoming barriers in data warehouse replatforming

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-11 without embargo terms

    uiuc Repository record for Overcoming barriers in data warehouse replatforming (opens in a new tab)