Nikolaos Koudas
Nikolaos Koudas, Ontario CA
Patent application number | Description | Published |
---|---|---|
20100114840 | SYSTEMS AND ASSOCIATED COMPUTER PROGRAM PRODUCTS THAT DISGUISE PARTITIONED DATA STRUCTURES USING TRANSFORMATIONS HAVING TARGETED DISTRIBUTIONS - 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. | 05-06-2010 |
Nikolaos Koudas, Springfield, NJ US
Patent application number | Description | Published |
---|---|---|
20080275908 | SYSTEM, METHOD AND COMPUTER-READABLE MEDIUM FOR PROVIDING PATTERN MATCHING - 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. | 11-06-2008 |
20090138469 | METHOD OF PATTERN SEARCHING - Structural join mechanisms provide efficient query pattern matching. In one embodiment, tree-merge mechanisms are provided. In another embodiment, stack-tree mechanisms are provided. | 05-28-2009 |
20090138470 | METHOD OF PATTERN SEARCHING - Structural join mechanisms provide efficient query pattern matching. In one embodiment, tree-merge mechanisms are provided. In another embodiment, stack-tree mechanisms are provided. | 05-28-2009 |
20100057805 | System, Method and Computer-Readable Medium for Providing Pattern Matching - 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. | 03-04-2010 |
20100100538 | METHOD AND APPARATUS FOR OPTIMIZING QUERIES UNDER PARAMETRIC AGGREGATION CONSTRAINTS - 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. | 04-22-2010 |
20100100553 | METHOD AND APPARATUS FOR RANKED JOIN INDICES - 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. | 04-22-2010 |
Nikolaos Koudas, New York, NY US
Patent application number | Description | Published |
---|---|---|
20100100552 | ROUTING XML QUERIES - 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. There is therefore provided a method for accessing data over a wide area network comprising: providing a decentralized architecture comprising a plurality of data nodes each having a database, a query processor and a path index, and a plurality of router nodes each having a routing state, maintaining a routing state in each of the router nodes, broadcasting routing state updates from each of the databases to the router nodes, routing path queries to each of the databases by accessing the routing state. | 04-22-2010 |
20130275407 | ADAPTIVE PROCESSING OF TOP-K QUERIES IN NESTED-STRUCTURE ARBITRARY MARKUP LANGUAGE SUCH AS XML - A method of adaptively evaluating a top-k query involves ( | 10-17-2013 |
Nikolaos Koudas, Toronto CA
Patent application number | Description | Published |
---|---|---|
20160119320 | METHOD AND SYSTEM FOR SECURE DEPLOYMENT AND USE OF BLUETOOTH LOW ENERGY BEACONS AND OTHER NETWORK DEVICES - 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. The server computer or computer network service received the modified identifier, and based on the predetermined pattern, determine whether the modified identifier is the same as the expected identifier for the beacon based on the predetermined pattern, and uses this information to authenticate the beacon, and based on this authentication authorize the one or more digital commerce or advertising processes. A related method for providing network security is provided. Related systems and methods are provided for securing beacons, and deploying and managing beacons. | 04-28-2016 |