Results 51 to 60 of about 327,421 (217)
Query Expansion Based on Clustered Results [PDF]
Proceedings of the VLDB Endowment (PVLDB), Vol. 4, No. 6, pp.
350-361 (2011), 2011 Query expansion is a functionality of search engines that suggests a set of related queries for a user-issued keyword query. Typical corpus-driven keyword query expansion approaches return popular words in the results as expanded queries. Using these approaches, the expanded queries may correspond to a subset of possible query semantics, and thus miss ...
arxiv
A Novel Urban Emergency Path Planning Method Based on Vector Grid Map
IEEE Access, 2020 When an emergency occurs in the city, a large area of road congestion usually occurs. Therefore, it is particularly important to provide an effective emergency path planning strategy for vehicles.
Bowen Yang +5 more
doaj +1 more source
Optimization of Queries Containing Conjunctions of Conditions
Моделирование и анализ информационных систем, 2011 A new algorithm for query optimization is proposed. This algorithm simplifies queries restriction containing multi-attribute conditions. It also solves the problem of "Condition AND Conjunction of conditions" expressions.
S. D. Kuznetsov, N. A. Mendkovich
doaj
Ontological Queries: Rewriting and Optimization (Extended Version) [PDF]
arXiv, 2011 Ontological queries are evaluated against an ontology rather than directly on a database. The evaluation and optimization of such queries is an intriguing new problem for database research. In this paper we discuss two important aspects of this problem: query rewriting and query optimization.
arxiv
Cache Pattern with Multi-Queries
Advances in Electrical and Computer Engineering, 2010 This article proposes a cache pattern with multi-queries and describes the multi-query optimization with scheduling, caching and pipelining. A set of cache patterns is derived from a set of class of multi-queries that are loaded into the cache.
TUDOR, N. L.
doaj +1 more source
Sprinkling Selections over Join DAGs for Efficient Query Optimization [PDF]
arXiv, 2002 In optimizing queries, solutions based on AND/OR DAG can generate all possible join orderings and select placements before searching for optimal query execution strategy. But as the number of joins and selection conditions increase, the space and time complexity to generate optimal query plan increases exponentially.
arxiv
Proceedings of the 2019 International Conference on Management of Data, 2019 In recent decades, we observed the rapid growth of several big data platforms. Each of them is designed for specific demands. For instance, Spark can efficiently process iterative queries, while Storm is designed for in-memory processing. In this context, the complexity of these distributed systems make it much harder to develop rigorous cost models ...
openaire +1 more source
One Size Does Not Fit All: Querying Web Polystores
IEEE Access, 2019 Data retrieval systems are facing a paradigm shift due to the proliferation of specialized data storage engines (SQL, NoSQL, Column Stores, MapReduce, Data Stream, and Graph) supported by varied data models (CSV, JSON, RDB, RDF, and XML).
Yasar Khan +5 more
doaj +1 more source
A Novel Adaptive Cuckoo Search for Optimal Query Plan Generation
The Scientific World Journal, 2014 The emergence of multiple web pages day by day leads to the development of the semantic web technology. A World Wide Web Consortium (W3C) standard for storing semantic web data is the resource description framework (RDF). To enhance the efficiency in the
Ramalingam Gomathi, Dhandapani Sharmila
doaj +1 more source
Multi-Query Optimization Revisited: A Full-Query Algebraic Method. [PDF]
Proc IEEE Int Conf Big Data, 2022 Tu Y, Eslami M, Xu Z, Charkhgard H.
europepmc +1 more source