default search action
Edward Omiecinski
Person information
- affiliation: Georgia Institute of Technology, Atlanta, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j22]Binh Han, Ling Liu, Edward Omiecinski:
A Systematic Approach to Clustering Whole Trajectories of Mobile Objects in Road Networks. IEEE Trans. Knowl. Data Eng. 29(5): 936-949 (2017) - 2015
- [j21]Binh Han, Ling Liu, Edward Omiecinski:
Road-Network Aware Trajectory Clustering: Integrating Locality, Flow, and Density. IEEE Trans. Mob. Comput. 14(2): 416-429 (2015) - 2012
- [c41]Binh Han, Ling Liu, Edward Omiecinski:
NEAT: Road Network Aware Trajectory Clustering. ICDCS 2012: 142-151 - 2011
- [c40]Binh Han, Edward Omiecinski, Leo Mark, Ling Liu:
OTPM: Failure handling in data-intensive analytical processing. CollaborateCom 2011: 35-44 - [c39]Anja Gruenheid, Edward Omiecinski, Leo Mark:
Query optimization using column statistics in hive. IDEAS 2011: 97-105 - 2010
- [c38]Minh Quoc Nguyen, Edward Omiecinski, Leo Mark, Danesh Irani:
A Fast Randomized Method for Local Density-Based Outlier Detection in High Dimensional Data. DaWak 2010: 215-226
2000 – 2009
- 2009
- [c37]Weiyun Huang, Edward Omiecinski, Leo Mark, Minh Quoc Nguyen:
History Guided Low-Cost Change Detection in Streams. DaWaK 2009: 75-86 - [c36]Minh Quoc Nguyen, Edward Omiecinski, Leo Mark:
A Fast Feature-Based Method to Detect Unusual Patterns in Multidimensional Datasets. DaWaK 2009: 163-176 - 2008
- [c35]Minh Quoc Nguyen, Leo Mark, Edward Omiecinski:
Unusual Pattern Detection in High Dimensions. PAKDD 2008: 247-259 - 2007
- [j20]Christopher M. Jermaine, Edward Omiecinski, Wai Gen Yee:
The partitioned exponential file for database storage management. VLDB J. 16(4): 417-437 (2007) - 2005
- [j19]Carlos Ordonez, Edward Omiecinski:
Accelerating EM clustering to find high-quality solutions. Knowl. Inf. Syst. 7(2): 135-157 (2005) - [c34]Jun Li, Edward Omiecinski:
Efficiency and Security Trade-Off in Supporting Range Queries on Encrypted Databases. DBSec 2005: 69-83 - 2004
- [j18]Carlos Ordonez, Edward Omiecinski:
Efficient Disk-Based K-Means Clustering for Relational Databases. IEEE Trans. Knowl. Data Eng. 16(8): 909-921 (2004) - [c33]Weiyun Huang, Edward Omiecinski, Leo Mark:
Compression schemes for differential categorical stream clustering. CIKM 2004: 232-233 - 2003
- [j17]Edward Omiecinski:
Alternative Interest Measures for Mining Associations in Databases. IEEE Trans. Knowl. Data Eng. 15(1): 57-69 (2003) - [c32]Linas Bukauskas, Leo Mark, Edward Omiecinski, Michael H. Böhlen:
iTopN: incremental extraction of the N most visible objects. CIKM 2003: 461-468 - 2002
- [j16]Wai Gen Yee, Shamkant B. Navathe, Edward Omiecinski, Chris Jermaine:
Efficient Data Allocation over Multiple Channels at Broadcast Servers. IEEE Trans. Computers 51(10): 1231-1236 (2002) - [c31]Carlos Ordonez, Edward Omiecinski:
FREM: fast and robust EM clustering for large data sets. CIKM 2002: 590-599 - [c30]Wai Gen Yee, Shamkant B. Navathe, Edward Omiecinski, Chris Jermaine:
Bridging the Gap between Response Time and Energy-Efficiency in Broadcast Schedule Design. EDBT 2002: 572-589 - [c29]Chris Jermaine, Edward Omiecinski, Wai Gen Yee:
Out From Under the Trees. ICDE 2002: 265 - [c28]Chris Jermaine, Edward Omiecinski:
Lossy Reduction for Very High Dimensional Data. ICDE 2002: 663-672 - 2001
- [c27]Wai Gen Yee, Edward Omiecinski, Michael J. Donahoo, Shamkant B. Navathe:
Scaling Replica Maintenance In Intermittently Synchronized Mobile Databases. CIKM 2001: 450-457 - [c26]Chris Jermaine, Edward Omiecinski, Wai Gen Yee:
Maintaining a Large Spatial Database with T2SM. ACM-GIS 2001: 76-81 - [c25]Carlos Ordonez, Edward Omiecinski, Levien de Braal, Cesar A. Santana, Norberto F. Ezquerra, José A. Taboada, C. David Cooke, Elizabeth Krawczynska, Ernest V. Garcia:
Mining Constrained Association Rules to Predict Heart Disease. ICDM 2001: 433-440 - [c24]Carlos Ordonez, Edward Omiecinski, Norberto F. Ezquerra:
A Fast Algorithm to Cluster High Dimensional Basket Data. ICDM 2001: 633-636
1990 – 1999
- 1999
- [c23]Carlos Ordonez, Edward Omiecinski:
Discovering Association Rules Based on Image Content. ADL 1999: 38-49 - [c22]Chris Jermaine, Anindya Datta, Edward Omiecinski:
A Novel Index Supporting High Volume Data Warehouse Insertion. VLDB 1999: 235-246 - 1998
- [c21]Edward Omiecinski, Ashok Savasere:
Efficient Mining of Association Rules in Large Dynamic Databases. BNCOD 1998: 49-63 - [c20]Ashok Savasere, Edward Omiecinski, Shamkant B. Navathe:
Mining for Strong Negative Associations in a Large Database of Customer Transactions. ICDE 1998: 494-502 - 1997
- [c19]Michael J. Donahoo, J. William Murdock, Ashok K. Goel, Shamkant B. Navathe, Edward Omiecinski:
From Data to Knowledge: Method-Specific Transformations. ISMIS 1997: 411-420 - 1996
- [j15]Edward Omiecinski:
Concurrent File Reorganization: Clustering, Conversion and Maintenance. IEEE Data Eng. Bull. 19(2): 25-32 (1996) - [c18]Shamkant B. Navathe, Sameer Mahajan, Edward Omiecinski:
Rule Based Database Integration in HIPED: Heterogeneous Intelligent Processing in Engineering Design. CODAS 1996: 48-55 - [c17]Vibby Gottemukkala, Edward Omiecinski, Umakishore Ramachandran:
Relaxed Index Consistency for a Client-Server Database. ICDE 1996: 352-361 - [c16]Sreenivas Gukal, Edward Omiecinski, Umakishore Ramachandran:
Transient Versioning for Consistency and Concurrency in Client-Server Systems. PDIS 1996: 274-285 - [c15]Kiran J. Achyutuni, Edward Omiecinski, Shamkant B. Navathe:
Two Techniques for On-Line Index Modification in Shared Nothing Parallel Databases. SIGMOD Conference 1996: 125-136 - 1995
- [j14]Byeong-Soo Jeong, Edward Omiecinski:
Inverted File Partitioning Schemes in Multiple Disk Systems. IEEE Trans. Parallel Distributed Syst. 6(2): 142-153 (1995) - [c14]Sreenivas Gukal, Edward Omiecinski, Umakishore Ramachandran:
An Efficient Transient Versioning Method. BNCOD 1995: 155-171 - [c13]Alfred R. Watkins, Edward Omiecinski:
Storing Continuous Media Objects Using Parallelism With Merging. COMPSAC 1995: 339-345 - [c12]Ashok Savasere, Edward Omiecinski, Shamkant B. Navathe:
An Efficient Algorithm for Mining Association Rules in Large Databases. VLDB 1995: 432-444 - [p1]Edward Omiecinski:
Parallel Relational Database Systems. Modern Database Systems 1995: 494-512 - 1994
- [j13]Edward Omiecinski, Liehuey Lee, Peter Scheuermann:
Performance Analysis of a Concurrent File Reorganization Algorithm for Record Clustering. IEEE Trans. Knowl. Data Eng. 6(2): 248-257 (1994) - [j12]Eileen Tien Lin, Edward Omiecinski, Sudhakar Yalamanchili:
Large Join Optimization on a Hypercube Multiprocessor. IEEE Trans. Knowl. Data Eng. 6(2): 304-315 (1994) - [c11]Vibby Gottemukkala, Edward Omiecinski, Umakishore Ramachandran:
A scalable sharing architecture for a parallel database system. SPDP 1994: 110-117 - 1993
- [j11]Edward Omiecinski:
An analytical comparison to two secondary index schemes: physical versus logical addresses. Inf. Syst. 18(5): 319-328 (1993) - [j10]Jörg Liebeherr, Edward Omiecinski, Ian F. Akyildiz:
The Effect of Index Partitioning Schemes on the Performance of Distributed Query Processing. IEEE Trans. Knowl. Data Eng. 5(3): 510-522 (1993) - 1992
- [j9]Edward Omiecinski, Eileen Tien Lin:
The Adaptive-Hash Join Algorithm for a Hypercube Multicomputer. IEEE Trans. Parallel Distributed Syst. 3(3): 334-349 (1992) - [c10]Martin R. Frank, Edward Omiecinski, Shamkant B. Navathe:
Adaptive and Automated Index Selection in RDBMS. EDBT 1992: 277-292 - [c9]Eileen Tien Lin, Edward Omiecinski, Sudhakar Yalamanchili:
Parallel Optimization and Execution of Large Join Queries. FGCS 1992: 907-914 - [c8]Edward Omiecinski, Liehuey Lee, Peter Scheuermann:
Concurrent File Reorganization for Record Clustering: A Performance Study. ICDE 1992: 265-272 - 1991
- [j8]Edward Omiecinski, Wei Liu, Ian F. Akyildiz:
Analysis of a deferred and incremental update strategy for secondary indexes. Inf. Syst. 16(3): 345-356 (1991) - [c7]Edward Omiecinski:
Performance Analysis of a Load Balancing Hash-Join Algorithm for a Shared Memory Multiprocessor. VLDB 1991: 375-385 - 1990
- [j7]Edward Omiecinski, Peter Scheuermann:
A Parallel Algorithm for Record Clustering. ACM Trans. Database Syst. 15(4): 599-624 (1990) - [j6]Edward Omiecinski:
A Parallel Algorithm for Relational Database Normalization. IEEE Trans. Parallel Distributed Syst. 1(4): 415-423 (1990) - [c6]Edward Omiecinski, Ron Shonkwiler:
Parallel Join Processing Using Nonclustered Indexes for a Shared Memory Multiprocessor. SPDP 1990: 144-151
1980 – 1989
- 1989
- [j5]Peter Scheuermann, Young Chul Park, Edward Omiecinski:
A Heuristic File Reorganization Algorithm Based on Record Clustering. BIT 29(3): 428-447 (1989) - [j4]Edward Omiecinski, Eileen Tien Lin:
A Hash-Based Join Algorithm for a Cube-Connected Parallel Computer. Inf. Process. Lett. 30(5): 269-275 (1989) - [j3]Edward Omiecinski:
Concurrent file conversion between B+-tree and linear hash files. Inf. Syst. 14(5): 371-383 (1989) - [j2]Edward Omiecinski, Eileen Tien Lin:
Hash-Based and Index-Based Join Algorithms for Cube and Ring Connected Multicomputers. IEEE Trans. Knowl. Data Eng. 1(3): 329-343 (1989) - [j1]Edward Omiecinski:
Heuristics for Join Processing Using Nonclustered Indexes. IEEE Trans. Software Eng. 15(1): 18-25 (1989) - [c5]Peter Scheuermann, Young Chul Park, Edward Omiecinski:
Heuristic Reorganization of Clustered Files. FODO 1989: 16-30 - [c4]Edward Omiecinski, Wei Liu, Ian F. Akyildiz:
An Analytical Model of a Deferred and Incremental Update Strategy for Secondary Indexes. FODO 1989: 217-222 - 1988
- [c3]Edward Omiecinski:
Concurrent Storage Structure Conversion: from B+ Tree to Linear Hash File. ICDE 1988: 589-596 - 1985
- [c2]Edward Omiecinski:
Incremental File Reorganization Schemes. VLDB 1985: 346-357 - 1984
- [c1]Edward Omiecinski, Peter Scheuermann:
A Global Approach to Record Clustering and File Reorganization. SIGIR 1984: 201-219
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint