Filters








962 Hits in 5.8 sec

Page 453 of Mathematical Reviews Vol. , Issue 89A [page]

1989 Mathematical Reviews  
Paredaens (Wilrijk) 89a:68036 68P15 Chang, Chin-Chen [Chang, Chén Ch’éng] (RC-CHH-AM); Chang, Syh-Shyan [Chang, Tz’i Hsien] (RC-CHH-AM) Optimal Cartesian product files for orthogonal range queries.  ...  Summary: “This paper proposes a record organization strategy to construct optimal Cartesian product files for othogonal range retrieval.  ... 

Page 1909 of Mathematical Reviews Vol. , Issue 97C [page]

1997 Mathematical Reviews  
(RC-NCT-CS; Hsinchu) ; Yang, Wei-Pang (RC-NCT-CS; Hsinchu); Chang, Chin-Chen Some properties of optimal Cartesian product files for orthogonal range queries. (English summary) Inform.  ...  Summary: “The Cartesian product file (CPF) has been proposed as a good multi-attribute file structure.  ... 

Some properties of optimal cartesian product files for orthogonal range queries

Annie Y.H. Chou, Wei-Pang Yang, Chin-Chen Chang
1996 Information Sciences  
Cartesian product file (CPF) has been proposed as a good multi-attribute file structure.  ...  In our work, we paid particular attention to the design of Cartesian product files (CPFs) for ORQs.  ...  Consider a two-attribute file with D 1 = {a,b} and D 2 = {1, 2, 3, 4, 5, If Dll={a,b}, D2l={1}, D22={2}, D23={3}, D26 = {6}. Then the following file F is a CPF.  ... 
doi:10.1016/0020-0255(95)00284-7 fatcat:ua2hz2tvo5c3djjbg4vblulyhu

Letter from the Editor-in-Chief

David B. Lomet
1994 IEEE Data Engineering Bulletin  
Papers for each issue are solicited by and should be sent to the Associate Editor responsible for the issue.  ...  , for temporal and spatial data, and (iii) development of example applications on top of the prototype [22].  ...  We would also like to thank the anonymous referees for their valuable comments. This research has been supported in part by the National Science Foundation grant IRI-9110584.  ... 
dblp:journals/debu/Lomet94b fatcat:7l5q3uztsravzmxggax7mdwmeq

Query optimization in the presence of limited access patterns

Daniela Florescu, Alon Levy, Ioana Manolescu, Dan Suciu
1999 SIGMOD record  
We consider the problem of query optimization in the presence of limitations on access patterns to the data (i.e., when one must provide values for one of the attributes of a relation in order to obtain  ...  We describe a theoretical and experimental analysis of the resulting search space and a novel query optimization algorithm that is designed to perform well under the different conditions that may arise  ...  For example, for the case of chain queries with n relations, the number of plans without Cartesian products is known to be ("'n"-;")$, while the number of bushy partial pl.ans without Cartesian products  ... 
doi:10.1145/304181.304210 fatcat:y66a2jp5czgljbprzbozkpt4va

Query optimization in the presence of limited access patterns

Daniela Florescu, Alon Levy, Ioana Manolescu, Dan Suciu
1999 Proceedings of the 1999 ACM SIGMOD international conference on Management of data - SIGMOD '99  
We consider the problem of query optimization in the presence of limitations on access patterns to the data (i.e., when one must provide values for one of the attributes of a relation in order to obtain  ...  We describe a theoretical and experimental analysis of the resulting search space and a novel query optimization algorithm that is designed to perform well under the different conditions that may arise  ...  For example, for the case of chain queries with n relations, the number of plans without Cartesian products is known to be ("'n"-;")$, while the number of bushy partial pl.ans without Cartesian products  ... 
doi:10.1145/304182.304210 dblp:conf/sigmod/FlorescuLMS99 fatcat:zp4rdcsn4jddthalwp6lm7aflu

Metadata management for scientific databases

Pietro Pinoli, Stefano Ceri, Davide Martinenghi, Luca Nanni
2019 Information Systems  
h i g h l i g h t s • ScQL: a metadata aware query language for databases of scientific samples. • ScQL is compiled to a lower level representation suitable for optimization. • The novel meta-first optimization  ...  We formally define each operation and we describe an optimization, called meta-first, that may significantly reduce the query processing overhead by anticipating the use of metadata for selectively loading  ...  We then consider an Apache dataset, where each sample is a project; there is one observation for each version (with date and note), whereas the metadata include generic aspects about the Apache project  ... 
doi:10.1016/j.is.2018.10.002 fatcat:knpivlnvmrewbhie4aeg237dna

Chapter 10: Join Methods and Query Optimization [chapter]

Daniele Braga, Stefano Ceri, Michael Grossniklaus
2010 Lecture Notes in Computer Science  
Then, this chapter presents an optimization framework for queries over several service interfaces, which considers several cost metrics for mapping queries into query plans, consisting of specific operations  ...  The fundamental operation discussed in this chapter is the binary join between two sources, which is influenced by the type (search vs. exact) of services and by the management (parallel vs. sequential  ...  Finally, Section 5 shows the optimization steps and heuristics leading to the selection of an optimal plan. State of the Art The background for this chapter ranges over several disciplines.  ... 
doi:10.1007/978-3-642-12310-8_10 fatcat:xsqcjdteyndxpfr4h66sr6g5yq

Data Extraction and Ad Hoc Query of an Entity--Attribute--Value Database

P. M. Nadkarni, C. Brandt
1998 JAMIA Journal of the American Medical Informatics Association  
Such systems have been optimized for real-time retrieval of individual patient data.  ...  The authors illustrate their approach to the attribute-centric query problem with ACT/DB, a database for managing clinical trials data.  ...  Structured query language has been greatly criticized for its non-orthogonality when aggregate functions are involved, and QK hides such non-orthogonality from the user. Figure 1 .  ... 
doi:10.1136/jamia.1998.0050511 pmid:9824799 pmcid:PMC61332 fatcat:n4hqe4kejnhmnfabf3l5yk6aly

Implementation Techniques of Complex Objects

Patrick Valduriez, Setrag Khoshafian, George P. Copeland
1986 Very Large Data Bases Conference  
In this paper, we investigate and analyze a range of alternative techniques for the storage of complex objects.  ...  Qualitative arguments for each of the strategies are discussed. Analytical results and initial implementation results based on fully decomposed schemes are presented.  ...  of the normalized storage model for complex objects.  ... 
dblp:conf/vldb/ValduriezKC86 fatcat:rietnrmanrflbbmt53rrritk7q

Some Approaches to Index Design for Cube Forest

Theodore Johnson, Dennis E. Shasha
1997 IEEE Data Engineering Bulletin  
Papers for each issue are solicited by and should be sent to the Associate Editor responsible for the issue.  ...  Acknowledgements I'd like to thank Ashish Gupta for his comments on this paper.  ...  The widely cited reasons being that these schemes do not scale well with increasing dimensionality and that for predicates on multiple categorical attributes a cartesian product of the keys will need to  ... 
dblp:journals/debu/JohnsonS97 fatcat:z4wqvcfxq5ajnggghvxaqsjhhy

A Survey on Efficient Processing of Similarity Queries over Neural Embeddings [article]

Yifan Wang
2022 arXiv   pre-print
So for measuring data similarities semantically, neural embedding is applied.  ...  Then we talk about recent approaches on designing the indexes and operators for highly efficient similarity query processing on top of embeddings (or more generally, high dimensional data).  ...  but it directly computes attribute-wise similarities between two records which results in a similarity vector rather than a scalar similarity value for each two records.  ... 
arXiv:2204.07922v1 fatcat:u5osyghs6vgppnj5gpnrzhae5y

Nephele/PACTs

Dominic Battré, Stephan Ewen, Fabian Hueske, Odej Kao, Volker Markl, Daniel Warneke
2010 Proceedings of the 1st ACM symposium on Cloud computing - SoCC '10  
Hence, it offers only very limited optimization opportunities.  ...  Our definition of PACTs allows to apply several types of optimizations on the data flow during the transformation.  ...  We also thank Guy Lohman for suggesting the name "PACT" for the contracts, as well as the anonymous reviewers for their constructive comments and suggestions.  ... 
doi:10.1145/1807128.1807148 dblp:conf/cloud/BattreEHKMW10 fatcat:7u6wfwtwjjaslc7nd5mdahlkjq

Geometric query types for data retrieval in relational databases

Olga Sourina, Seng H. Boey
1998 Data & Knowledge Engineering  
In the first class, the queries are: • Location queries, i.e. find all objects that contain a point. • Range queries, i.e. find all objects contained in a query window. • Intersection queries, i.e. find  ...  Generally, spatial database queries can be classified into two types: those based on locations of objects, and those based on objects themselves [37] .  ...  Acknowledgment We would like to thank the referees for their useful suggestions.  ... 
doi:10.1016/s0169-023x(97)00061-x fatcat:k6mgwmzdkvf2jjjj5vfjm7ujwu

Near-Optimal Distributed Band-Joins through Recursive Partitioning [article]

Rundong Li, Wolfgang Gatterbauer, Mirek Riedewald
2020 Proceedings of the ACM SIGMOD International Conference on Management of Data   pre-print
It is the first approach that is not only effective for one-dimensional band-joins but also for joins on multiple attributes.  ...  We explore how to resolve this tension between maximum load per worker and input duplication for band-joins between two relations.  ...  As seen in Figure 1 , band-joins generalize equi-join and Cartesian product. Partitioning algorithms with optimality guarantees exist only for these two extremes [1, 25, 28] . Example 2.  ... 
doi:10.1145/3318464.3389750 pmid:33568887 pmcid:PMC7872589 arXiv:2004.06101v1 fatcat:4bick2aa2fadnlfuzgkybksbhe
« Previous Showing results 1 — 15 out of 962 results