Patent
Efficiency in processing queries directed to static data sets
Amulya Mishra
- 06 Apr 2010
2
TL;DR: In this article, data is maintained indicating which conditions match which data items of a data set (e.g., rows) of a database and when a query is later received, the maintained data is quickly examined to determine the matching data items.
read more
Abstract: Data is maintained indicating which conditions match which data items (e.g., rows) of a data set (e.g., table(s) in a database). When a query is later received, the maintained data is quickly examined to determine the matching data items, thereby enhancing the throughput performance in processing queries directed to the data set.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Patent
Database anonymization for use in testing database-centric applications
Chen Fu,Mark Grechanik,Qing Xie +2 more
- 02 Aug 2011
TL;DR: In this article, at least one quasi-identifier attribute of a plurality of ranked attributes is selected for use in anonymizing a database each of the ranked attributes was ranked according to that attribute's effect on a database-centric application (DCA) being tested.
20
Patent
In-memory distributed database with a remote data store
Johnson Anoop Kochummen,White Ryan Mckenzie,Nanheng Wu +2 more
- 08 Oct 2019
TL;DR: In this paper, a distributed in-memory query processor may utilize a remote data store and column segments may be retrieved from the remote data stores and loaded into system memory of a computing node.
2
References
Patent
Secure data interchange
Frederick S. M. Herz,Walter Paul Labys,David C. Parkes,Sampath Kannan,Jason Eisner +4 more
- 27 Oct 2000
TL;DR: A secure data interchange system enables information about bilateral and multilateral interactions between multiple persistent parties to be exchanged and leveraged within an environment that uses a combination of techniques to control access to information, release of information, and matching of information back to parties as mentioned in this paper.
1.8K
Patent
Database access system
Andrew J. Szabo
- 14 Sep 2010
TL;DR: An improved human user computer interface system, wherein a user characteristic or set of characteristics, such as demographic profile or societal role, is employed to define a scope or domain of operation, is proposed in this article, where user privacy and anonymity is maintained by physical and algorithmic controls over access to the personal profiles, and releasing only aggregate data without personally identifying information or of small groups.
1.4K
Patent
Universal drill-down system for coordinated presentation of items in different databases
Neil Thomson,Andre Paiement,Dave Gould,Martin Petitclerc,Brian Donnelly,Gordon Chow +5 more
- 28 Aug 2006
TL;DR: In this paper, a system for capturing the context of, and translating, or mapping, from data in an originating database presentation, or in a originating format, to data in a target database presentation or target format is presented.
179
Patent
Method and apparatus for operating on data with a conceptual data manipulation language
Bassam Tabbara,Rico Mariani,Kristi L. Brandes +2 more
- 26 Feb 1999
TL;DR: In this article, a data services layer is disclosed which maintains a dictionary of conceptual information and physical information about the data, and requests are written in a conceptual query language (CQL) which substantially uses terms belonging to or derived from a natural language.
144
Patent
Database system with methodology for parallel schedule generation in a query optimizer
Sudipto Rai Chowdhuri
- 13 Oct 2004
TL;DR: In this paper, a database system with methodology for parallel schedule generation in a query optimizer is described, which comprises steps of: generating a plurality of parallel plans for obtaining data requested by the query, the parallel plans including parallel operators for executing portions of the query in parallel; adjusting parallel operators of each parallel plan if necessary based on resources available for executing the query; creating a schedule for each parallel plans indicating a sequence for execution of operators of a parallel plan; determining execution cost of each plan based on its schedule; and selecting a particular parallel plan having lowest execution cost for obtaining
120