Patents by Inventor Nikolaos Koudas
Nikolaos Koudas has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20230273925Abstract: The present disclosure provides methods and apparatus for calibrating cost estimator for trustworthy DBMS performance. An aspect of the disclosure provides for a method, which includes generating a plurality of plans for potential execution by a DBMS, each of the plurality of plans being configured to generate a same response to a same specified database query. The method further includes generating, for each plan, a set of probability-cost value pairs, each indicative of an estimated upper cost for said plan and a probability that a cost for said plan will be equal to or less than said estimated upper cost, if and when said plan is executed. The method further includes selecting one of the plurality of plans based at least in part on an evaluation of the sets of probability-cost value pairs for the plurality of plans, and causing the DBMS to execute the selected plan.Type: ApplicationFiled: February 25, 2022Publication date: August 31, 2023Applicants: HUAWEI CLOUD COMPUTING TECHNOLOGIES CO., LTD., York UniversityInventors: Yifan LI, Xiaohui YU, Nikolaos KOUDAS, Shu LIN, Calvin SUN, Chong CHEN
-
Publication number: 20160119320Abstract: A network security system is provided to secure one or more digital commerce or advertising processes for one more users, based on the presence of the one or more users in the proximity of one or more beacons. One or more coordinating components are associated with the beacons, and these provide an identifier uniquely to the one or more users. One or more security components are configured to automatically modify an identifier associated with each beacon, based on a predetermined pattern. One or more network connected devices associated with the one or more users, receive modified identifier, process one or more data elements, and communicate with a server computer or computer network service.Type: ApplicationFiled: October 23, 2015Publication date: April 28, 2016Inventors: NILESH BANSAL, NIKOLAOS KOUDAS
-
Patent number: 8645397Abstract: A method and apparatus for propagating updates in databases are disclosed. For example, the present method uses “blocking” and/or “thresholding” to delay update propagation and/or to limit the propagation of updates to an optimal stage. For example, the present method receives at least one database update and extracts at least one token from the at least one database update. The method then determines whether a threshold for propagating the at least one database update for the at least one token is reached. The method then propagates the at least one database update for updating an index structure of a database pertaining to the at least one token whose threshold has been reached.Type: GrantFiled: November 30, 2006Date of Patent: February 4, 2014Assignee: AT&T Intellectual Property II, L.P.Inventors: Nikolaos Koudas, Amit Jaywant Marathe, Divesh Srivastava
-
Patent number: 8606794Abstract: A method of adaptively evaluating a top-k query involves (1204) forming a servers having respective server queues storing candidate answers, processing (1322) the candidate answers, and (1232) providing a top-k set as a query evaluation. Processing includes (1402) adaptively choosing a winning server to whose queue a current candidate answer should be sent; (1404) sending the current candidate answer to the winning server's queue; (1334) adaptively choosing a next candidate answer to process from the winning server's queue; (1336) computing a join between the current candidate answer and next candidate answers at the winning server, so as to produce a new current candidate answer; and (1338) updating the top-k set with the new current candidate answer only if a score of the new current candidate answer exceeds a score of a top-k answer in a top-k set. A method of calculating scores for candidate answers is also provided.Type: GrantFiled: March 4, 2013Date of Patent: December 10, 2013Assignee: AT&T Intellectual Property II, L.P.Inventors: Sihem Amer-Yahia, Nikolaos Koudas, Amelie Marian-Guerrier, Divesh Srivastava
-
Publication number: 20130275407Abstract: A method of adaptively evaluating a top-k query involves (1204) forming a servers having respective server queues storing candidate answers, processing (1322) the candidate answers, and (1232) providing a top-k set as a query evaluation. Processing includes (1402) adaptively choosing a winning server to whose queue a current candidate answer should be sent; (1404) sending the current candidate answer to the winning server's queue; (1334) adaptively choosing a next candidate answer to process from the winning server's queue; (1336) computing a join between the current candidate answer and next candidate answers at the winning server, so as to produce a new current candidate answer; and (1338) updating the top-k set with the new current candidate answer only if a score of the new current candidate answer exceeds a score of a top-k answer in a top-k set. A method of calculating scores for candidate answers is also provided.Type: ApplicationFiled: March 4, 2013Publication date: October 17, 2013Inventors: Sihem Amer-Yahia, Nikolaos Koudas, Amelie Marian-Guerrier, Divesh Srivastava
-
Patent number: 8412714Abstract: A method of adaptively evaluating a top-k query involves (1204) forming a servers having respective server queues storing candidate answers, processing (1322) the candidate answers, and (1232) providing a top-k set as a query evaluation. Processing includes (1402) adaptively choosing a winning server to whose queue a current candidate answer should be sent; (1404) sending the current candidate answer to the winning server's queue; (1334) adaptively choosing a next candidate answer to process from the winning server's queue; (1336) computing a join between the current candidate answer and next candidate answers at the winning server, so as to produce a new current candidate answer; and (1338) updating the top-k set with the new current candidate answer only if a score of the new current candidate answer exceeds a score of a top-k answer in a top-k set. A method of calculating scores for candidate answers is also provided.Type: GrantFiled: March 7, 2005Date of Patent: April 2, 2013Assignee: AT&T Intellectual Property II, L.P.Inventors: Sihem Amer-Yahia, Nikolaos Koudas, Amélie Marian-Guerrier, Divesh Srivastava
-
Patent number: 8209342Abstract: A data structure that includes at least one partition containing non-confidential quasi-identifier microdata and at least one other partition containing confidential microdata is formed. The partitioned confidential microdata is disguised by transforming the confidential microdata to conform to a target distribution. The disguised confidential microdata and the quasi-identifier microdata are combined to generate a disguised data structure. The disguised data structure is used to carry out statistical analysis and to respond to a statistical query is directed to the use of confidential microdata. In this manner, the privacy of the confidential microdata is preserved.Type: GrantFiled: October 31, 2008Date of Patent: June 26, 2012Assignee: AT&T Intellectual Property I, LPInventors: Divesh Srivastava, Nikolaos Koudas, Ting Yu, Qing Zhang
-
Patent number: 8176016Abstract: A method and apparatus for rapid identification of column heterogeneity in databases are disclosed. For example, the method receives data associated with a column in a database. The method computes a cluster entropy for the data as a measure of data heterogeneity and then determines whether said data is heterogeneous in accordance with the cluster entropy.Type: GrantFiled: November 17, 2006Date of Patent: May 8, 2012Assignee: AT&T Intellectual Property II, L.P.Inventors: Bing Tian Dai, Nikolaos Koudas, Beng Chin Ooi, Divesh Srivastava, Suresh Venkatasubramanian
-
Patent number: 8131792Abstract: Certain exemplary embodiments provide a method comprising: automatically: receiving a plurality of elements for each of a plurality of continuous data streams; treating the plurality of elements as a first data stream matrix that defines a first dimensionality; reducing the first dimensionality of the first data stream matrix to obtain a second data stream matrix; computing a singular value decomposition of the second data stream matrix; and based on the singular value decomposition of the second data stream matrix, quantifying approximate linear correlations between the plurality of elements.Type: GrantFiled: May 23, 2008Date of Patent: March 6, 2012Assignee: AT&T Intellectual Property II, L.P.Inventors: Nikolaos Koudas, Sudipto Guha
-
Patent number: 8117190Abstract: Structural join mechanisms provide efficient query pattern matching. In one embodiment, tree-merge mechanisms are provided. In another embodiment, stack-tree mechanisms are provided.Type: GrantFiled: November 11, 2008Date of Patent: February 14, 2012Assignees: AT&T Intellectual Property II, L.P., The Regents of the University of MichiganInventors: Nikolaos Koudas, Divesh Srivastava, Jignesh M. Patel, Shurug Ali Al-Khalifa, Hosagrahar V. Jagadish, Yuqing Wu
-
Patent number: 8024346Abstract: A method and apparatus for ranked join indices includes a solution providing performance guarantees for top-k join queries over two relations, when preprocessing to construct a ranked join index for a specific join condition is permitted. The concepts of ranking join indices presented herein are also applicable in the case of a single relation. In this case, the concepts herein provide a solution to the top-k selection problem with monotone linear functions, having guaranteed worst case search performance for the case of two ranked attributes and arbitrary preference vectors.Type: GrantFiled: December 26, 2009Date of Patent: September 20, 2011Assignee: AT&T Intellectual Property II, L.P.Inventors: Nikolaos Koudas, Ioannis Kotidis, Themistoklis Palpanas, Divesh Srivastava, Panayiotis Tsaparas
-
Patent number: 8015179Abstract: Structural join mechanisms provide efficient query pattern matching. In one embodiment, tree-merge mechanisms are provided. In another embodiment, stack-tree mechanisms are provided.Type: GrantFiled: November 10, 2008Date of Patent: September 6, 2011Assignees: AT&T Intellectual Property II, L.P., National Science FoundationInventors: Nikolaos Koudas, Divesh Srivastava, Jignesh M. Patel, Shurug Ali Al-Khalifa, Hosagrahar V. Jagadish, Yuqing Wu
-
Patent number: 8001146Abstract: A vast amount of information currently accessible over the Web, and in corporate networks, is stored in a variety of databases, and is being exported as XML data. However, querying this totality of information in a declarative and timely fashion is problematic because this set of databases is dynamic, and a common schema is difficult to maintain. The present invention provides a solution to the problem of issuing declarative, ad hoc XPath queries against such a dynamic collection of XML databases, and receiving timely answers. There is proposed a decentralized architectures, under the open and the agreement cooperation models between a set of sites, for processing queries and updates to XML data. Each site consists of XML data nodes. (which export their data as XML, and also pose queries) and one XML router node (which manages the query and update interactions between sites). The architectures differ in the degree of knowledge individual router nodes have about data nodes containing specific XML data.Type: GrantFiled: December 22, 2009Date of Patent: August 16, 2011Assignee: AT&T Intellectual Property II, LPInventors: Nikolaos Koudas, Divesh Srivastava, Michael Rabinovich
-
Patent number: 7904458Abstract: The present invention relates to a method and apparatus for optimizing queries. The present invention discloses an efficient method for providing answers to queries under parametric aggregation constraints.Type: GrantFiled: December 26, 2009Date of Patent: March 8, 2011Assignee: AT&T Intellectual Property II, L.P.Inventors: Nikolaos Koudas, Divesh Srivastava, Sudipto Guha, Dimitrios Gunopulos, Michail Vlachos
-
Patent number: 7904444Abstract: A method and system for performing a data stream query. A data stream query requiring a join operation on multiple data streams is approximated without performing the join operation. It is determined whether conditions of the query are proper to accurately approximate the join operation, and if the conditions are proper the join operation is approximated. The join operation is approximated by independently aggregating values of the data streams and comparing the independently aggregated values.Type: GrantFiled: April 26, 2006Date of Patent: March 8, 2011Assignee: AT&T Intellectual Property II, L.P.Inventors: Nikolaos Koudas, Divesh Srivastava, David Toman
-
Patent number: 7895194Abstract: A system, method and computer-readable medium are disclosed for identifying representative data using sketches. The method embodiment comprises generating a plurality of vectors from a data set, modifying each of the vectors of the plurality of vectors and selecting one of the plurality of generated vectors according to a comparison of a summed distance between a modified vector associated with the selected generated vector and remaining modified vectors. Modifying the generated vectors may involve reduced each generated vector to a lower dimensional vector. The summed distance then represents a summed distance between the lower dimensional vector and remaining lower dimensional vectors.Type: GrantFiled: November 10, 2009Date of Patent: February 22, 2011Assignee: AT&T Intellectual Property II, L.P.Inventors: Piotr Indyk, Nikolaos Koudas, Shanmugavelayutham Muthukrishnan
-
Publication number: 20100114840Abstract: A data structure that includes at least one partition containing non-confidential quasi-identifier microdata and at least one other partition containing confidential microdata is formed. The partitioned confidential microdata is disguised by transforming the confidential microdata to conform to a target distribution. The disguised confidential microdata and the quasi-identifier microdata are combined to generate a disguised data structure. The disguised data structure is used to carry out statistical analysis and to respond to a statistical query is directed to the use of confidential microdata. In this manner, the privacy of the confidential microdata is preserved.Type: ApplicationFiled: October 31, 2008Publication date: May 6, 2010Inventors: Divesh Srivastava, Nikolaos Koudas, Ting Yu, Qing Zhang
-
Publication number: 20100100553Abstract: A method and apparatus for ranked join indices includes a solution providing performance guarantees for top-k join queries over two relations, when preprocessing to construct a ranked join index for a specific join condition is permitted. The concepts of ranking join indices presented herein are also applicable in the case of a single relation. In this case, the concepts herein provide a solution to the top-k selection problem with monotone linear functions, having guaranteed worst case search performance for the case of two ranked attributes and arbitrary preference vectors.Type: ApplicationFiled: December 26, 2009Publication date: April 22, 2010Inventors: NIKOLAOS KOUDAS, IOANNIS KOTIDIS, Themistoklis Palpanas, Divesh Srivastava, Panayiotis Tsaparas
-
Publication number: 20100100552Abstract: A vast amount of information currently accessible over the Web, and in corporate networks, is stored in a variety of databases, and is being exported as XML data. However, querying this totality of information in a declarative and timely fashion is problematic because this set of databases is dynamic, and a common schema is difficult to maintain. The present invention provides a solution to the problem of issuing declarative, ad hoc XPath queries against such a dynamic collection of XML databases, and receiving timely answers. There is proposed a decentralized architectures, under the open and the agreement cooperation models between a set of sites, for processing queries and updates to XML data. Each site consists of XML data nodes. (which export their data as XML, and also pose queries) and one XML router node (which manages the query and update interactions between sites). The architectures differ in the degree of knowledge individual router nodes have about data nodes containing specific XML data.Type: ApplicationFiled: December 22, 2009Publication date: April 22, 2010Inventors: Nikolaos Koudas, Divesh Srivastava, Michael Rabinovich
-
Publication number: 20100100538Abstract: The present invention relates to a method and apparatus for optimizing queries. The present invention discloses an efficient method for providing answers to queries under parametric aggregation constraints.Type: ApplicationFiled: December 26, 2009Publication date: April 22, 2010Inventors: NIKOLAOS KOUDAS, Divesh Srivastava, Sudipto Guha, Dimitriious Gunopoulos, Michail Vlachos